原题链接在这里:https://leetcode.com/problems/valid-palindrome/
题目:
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
For example,"A man, a plan, a canal: Panama"
is a palindrome."race a car"
is not a palindrome.
Note:
Have you consider that the string might be empty? This is a good question to ask during an interview.
For the purpose of this problem, we define empty string as valid palindrome.
题解:
注意在用Character.isLetterOrDigit(s.charAt(i)) 前需检验 i 是否index out of bound 了.
Time Complexity: O(n), n = s.length(). Space: O(1).
AC Java:
1 public class Solution { 2 public boolean isPalindrome(String s) { 3 if(s == null || s.length() == 0){ 4 return true; 5 } 6 7 s = s.trim().toLowerCase(); 8 int l = 0; 9 int r = s.length()-1; 10 while(l<r){ 11 while(l<r && !Character.isLetterOrDigit(s.charAt(l))){ 12 l++; 13 } 14 while(l<r && !Character.isLetterOrDigit(s.charAt(r))){ 15 r--; 16 } 17 18 if(l<r && s.charAt(l)!=s.charAt(r)){ 19 return false; 20 } 21 l++; 22 r--; 23 } 24 return true; 25 } 26 }