[알고리즘] 문자열이 몇 번 등장하는지 세기도움말 Java

 

class Solution {
    public int solution(String myString, String pat) {
        int answer = 0;
        int i=0;
        int j=pat.length()-1;
        while (j < myString.length()) {
          if (myString.substring(i, j+1).equals(pat)) {
            answer++;
          }
          i++;
          j++;
        }
        return answer;
    }
}

 

class Solution {
    public int solution(String myString, String pat) {
        int cnt = 0;
        for(int i=0; i<myString.length(); i++) {
            if(myString.substring(i).startsWith(pat)){
                cnt++;
            }
        }
        return cnt;
    }
}