leetcode 125:验证回文串

bool isPalindrome(std::string s){
	std::vector<char> a;
	for(int i=0;i<s.size();i++){
		if((s[i]>='a'&&s[i]<='z')||(s[i]>='0'&&s[i]<='9'))
			a.push_back(s[i]);
		if(s[i]>='A'&&s[i]<='Z')
		{
			s[i]=s[i]+32;
			a.push_back(s[i]);
		}
	}
	for(int i=0;i<a.size()/2;i++){
		if(a[i]!=a[a.size()-1-i])
			return false;
	}
	return true;
}