[알고리즘문제풀기] 문자열 밀기

문제

내가 작성한 정답

class Solution {
    public int solution(String A, String B) {
        int answer = 0, len = A.length();
        for(int j=0; j<len; j++){
            char[] ch = new char[len];
            for(int i=0; i<len;i++){
                ch[(i+j)%len] += +A.charAt(i);
            }
            if(String.valueOf(ch).equals(B)) return j;
        }
        return -1;
    }
}

다른 사람들의 정답

class Solution {
    public int solution(String A, String B) {
        String tempB = B.repeat(3);
        return tempB.indexOf(A);
    }
}

class Solution {
    public int solution(String A, String B) {

        return (B+B).indexOf(A);
    }
}

class Solution {
    public int solution(String A, String B) {
        int answer = 0;
        if(A.equals(B)) return 0;

        while(answer<A.length()){
            answer++;
            A = A.substring(A.length()-1) + A.substring(0,A.length()-1);
            if(B.equals(A)) break;

        }
        if(answer==A.length()) answer = -1;

        return answer;
    }
}