首页 > 其他 > 详细

125 Valid Palindrome

时间:2015-07-13 10:16:22      阅读:230      评论:0      收藏:0      [点我收藏+]

125 Valid Palindrome

链接: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.

Hide Tags Two Pointers String
Hide Similar Problems (E) Palindrome Linked List

求一个字符串是不是回文字符串,只关注字母和数字,并且忽略字母的大小写。

class Solution {
public:
    bool isPalindrome(string s) {
        string str="",rstr;
        for(int i=0;i<s.size();i++)
        {
          if((s[i]>47&&s[i]<58)||(s[i]>64&&s[i]<91))
              str+=s[i];
          else if(s[i]>96&&s[i]<123)
              str+=s[i]-32;
        }
        rstr=str;
        reverse(str.begin(),str.end());
        return rstr==str;
    }
};

版权声明:本文为博主原创文章,未经博主允许不得转载。

125 Valid Palindrome

原文:http://blog.csdn.net/efergrehbtrj/article/details/46858793

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