[코테 풀이] Reverse Prefix of Word

Q_2000) Reverse Prefix of Word

출처 : https://leetcode.com/problems/reverse-prefix-of-word/

Given a 0-indexed string word and a character ch, reverse the segment of word that starts at index 0 and ends at the index of the first occurrence of ch (inclusive). If the character ch does not exist in word, do nothing.

For example, if word = "abcdefd" and ch = "d", then you should reverse the segment that starts at 0 and ends at 3 (inclusive). The resulting string will be "dcbaefd".

Return the resulting string.

class Solution {
    public String reversePrefix(String word, char ch) {
        String subs = "";
        int ind = 0;
        for (int i = 0; i < word.length(); i++) {
            if (word.charAt(i) == ch) {
                ind = i;
                break;
            }
        }
        for (int j = ind; j >= 0; j--) {
            subs += word.charAt(j);
        }
        if(subs.length()==0){
            return word;
        }
        return subs+word.substring(ind+1);
    }
}