Leetcode 字符串 Valid Palindrome

本文为senlie原创，转载请保留此地址：http://blog.csdn.net/zhengsenlie

Valid Palindrome

  Total Accepted: 11192  Total Submissions: 50925

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.

题意：判断给定的字符串是不是回文（只考数字和字母）
思路：
1.先把字符串转换为小写的
2.两个下标分别从头从尾开始扫描
3.要过滤掉不是数字字母的字符
通过这道题主要是学习了
1.stl里algorithm的trnsform
2.cctype里的isalnum,tolower等
3.tolower在cctype的global namespace里有，在local的std namespace里也有，要用cctype里的tolower可用::tolower
复杂度：时间O(n)，空间O(1)

class Solution {
public:
	bool isPalindrome(std::string s) {
		int start = 0, end = s.size() - 1;
		std::transform(s.begin(), s.end(), s.begin(), ::tolower);
		while(start < end){
			while(start < end && !isalnum(s[start])) start++;
			while(start < end && !isalnum(s[end])) end--;
			if(s[start] != s[end]) break;
			start++;
			end--;
		}
		return start >= end ? true : false;
	}
};