码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] Valid Palindrome

时间:2014-08-01 22:31:42      阅读:208      评论:0      收藏:0      [点我收藏+]

标签:style   blog   color   os   strong   io   for   ar   

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.

class Solution {
public:
    bool isPalindrome(string s) {
        int len = s.size();
        if(len<2)
            return true;
        
        for(int i=0,j=len-1;i<j;i++,j--){
          
          while(i<len && ((s[i] >= a && s[i] <= z) || (s[i]>=A && s[i]<=Z) || (s[i]>=0 && s[i]<=9))==false)
           i++;
          while(j>=0 && ((s[j] >= a && s[j] <= z) || (s[j]>=A && s[j]<=Z) || (s[j]>=0 && s[j]<=9))==false)
           j--;
          if(i<j && ((s[i]== s[j] || abs(s[i]-s[j])==a-A)==false))
           return false;
        
        }
        return true;

    }
};

 

[LeetCode] Valid Palindrome,布布扣,bubuko.com

[LeetCode] Valid Palindrome

标签:style   blog   color   os   strong   io   for   ar   

原文地址:http://www.cnblogs.com/Xylophone/p/3885672.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!