LeetCode OJ：Valid Palindrome（验证回文）

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.

验证回文与否，这个估计大家学c语言的时候就都写过：

 class Solution {
 public:
     bool isPalindrome(string s) {
         int len = s.length();
         for(int i = , j = len - ; i < j ;++i, --j){
             while(i < j && (!isalpha(s[i]) && !isdigit(s[i])))
                 i++;
             while(j > i && (!isalpha(s[j]) && !isdigit(s[j])))
                 j--;
             if(isalpha(s[i]) && isalpha(s[j])){
                 if(toupper(s[i]) == toupper(s[j]))
                     continue;
                 else return false;
             }else{
                 if(s[i] == s[j])
                     continue;
                 return false;
             }
         }
         return true;
     }
 };

java版本的代码如下所示，算法没有变化：

public class Solution {
    public boolean isPalindrome(String s) {
         int sz = s.length();
         int beg = 0, end = sz - 1;
         while(beg < end){
             while(!Character.isLetter(s.charAt(beg)) && !Character.isDigit(s.charAt(beg))){
                 if(beg < end) beg++;
                 else return true;
             }
             while(!Character.isLetter(s.charAt(end)) && !Character.isDigit(s.charAt(end))){
                 if(beg < end) end--;
                 else return true;
             }
             if(Character.toUpperCase(s.charAt(beg)) == Character.toUpperCase(s.charAt(end))){
                 beg++;
                 end--;
             }else{
                 return false;
             }
         }
         return true;
    }
}