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

문제

내가 작성한 정답

class Solution {
    public String solution(String my_string, int s, int e) {
        String[] answer = my_string.split("");
        String part = my_string.substring(s,e+1);
        for(int i=0; i<=e-s; i++){
            answer[s+i] = ""+my_string.charAt(e-i);
        }
        return String.join("",answer);
    }
}


class Solution {
    public String solution(String my_string, int s, int e) {
        char[] answer = my_string.toCharArray();
        String part = my_string.substring(s,e+1);
        for(int i=0; i<=e-s; i++){
            answer[s+i] = my_string.charAt(e-i);
        }
        return new String(answer);
    }
}

다른 사람들의 정답

class Solution {
    public String solution(String my_string, int s, int e) {
        StringBuilder answer = new StringBuilder(my_string.substring(s, e + 1));
        answer.reverse();
        return my_string.substring(0, s) + answer + my_string.substring(e + 1);
    }
}

class Solution {
    public String solution(String my_string, int s, int e) {

        char[] arr = my_string.toCharArray();
        while (s < e) {
            char temp = arr[s];
            arr[s++] = arr[e];
            arr[e--] = temp;
        }

        return new String(arr);
    }
}