Grind75
문제로

풀이

1
2
3
4
5
6
7
8
9

class Solution {
    public boolean isPalindrome(String s) {
        s = s.toLowerCase().replaceAll("[^a-z0-9]", "");
        int point = s.length() / 2;

        StringBuffer sb = new StringBuffer(s.substring(s.length() - point));
        return s.substring(0,point).equals(sb.reverse().toString());
    }
}

image

풀이 2

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14

class Solution {
    public boolean isPalindrome(String s) {
        s = s.toLowerCase().replaceAll("[^a-z0-9]", "");
        
        int left = 0;
        int right = s.length() - 1;

        while(left < right) {
            if(s.charAt(left++) != s.charAt(right--)) return false;
        }

        return true;
    }
}

image