[LeetCode/릿코드] 125. Valid Palindrome
문제 풀이 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 class Solution { public boolean isPalindrome(String s) { String lower = s.toLowerCase(); String replace = lower.replaceAll("[^a-z0-9]", ""); StringBuilder sb = new StringBuilder(replace); String reverse = sb.reverse().toString(); if(replace.equals(reverse)){ return true; } return false; } } Colored by Color Scripter cs
