import java.util.Objects; import java.util.Stack; class Solution { public boolean isPalindrome(String s) { if (Objects.isNull(s)) { return true; } char[] chars = s.toCharArray(); StringBuilder sb = new StringBuilder(); for (int i = 0;i < chars.length; ++ i) { if (Character.isLetterOrDigit(chars[i])) { sb.append(Character.toLowerCase(chars[i])); } } int m = sb.length() >> 1; for (int i = 0;i < m; ++ i) { if (sb.charAt(i) != sb.charAt(sb.length() - i - 1)) { return false; } } return true; } }
LeetCode - 125. 验证回文串
猜你喜欢
转载自blog.51cto.com/tianyiya/2174659
今日推荐
周排行