首页 > 其他 > 详细

LeetCode 125. Valid Palindrome

时间:2016-08-08 11:01:09      阅读:235      评论:0      收藏:0      [点我收藏+]

这个题目只要注意大小写问题即可解决,而且我们只关注的是字母和数值

 

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 start = 0, end = s.size() - 1;
        while (start < end)
        {
            if (a <= s[start] && s[start] <= z || A <= s[start] && s[start] <= Z ||
                0 <= s[start] && s[start] <= 9)
            {
                bool tag = true;
                while (tag)
                {
                    if (a <= s[end] && s[end] <= z || A <= s[end] && s[end] <= Z ||
                        0 <= s[end] && s[end] <= 9)
                    {
                        if (s[start] == s[end]||s[start]==toupper(s[end])||s[start]==tolower(s[end]))
                        {
                            ++start;
                            --end;
                            tag = false;
                            
                        }
                        else
                        {
                            return false;
                        }
                    }
                    else
                    {
                        --end;
                        tag = true;
                    }
                }
            }
            else
                ++start;
        }
        return true;
    }
};

 

LeetCode 125. Valid Palindrome

原文:http://www.cnblogs.com/csudanli/p/5748400.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!