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.

class Solution {
public:
    bool isPalindrome(string s) {
    int nCount=0;
	int nLen=s.length();
	for(int i=0;i<nLen;++i)
	{
		if((toupper(s[i])>='A' && toupper(s[i])<='Z') || (s[i]>='0' && s[i]<='9'))
		{
			++nCount;
		}
	}

	if(nCount==1) //一个有效字符的情况
	{
		return true;
	}

	int nBegin=0;
	int nEnd=nLen-1;
	int nCompare=0;
	while(nBegin<nEnd)
	{
		if(!((toupper(s[nBegin])>='A' && toupper(s[nBegin])<='Z') ||(s[nBegin]>='0' && s[nBegin]<='9')))
		{
			++nBegin;
			continue;
		}

		if(!((toupper(s[nEnd])>='A' && toupper(s[nEnd])<='Z')||(s[nEnd]>='0' && s[nEnd]<='9')))
		{
			--nEnd;
			continue;
		}


		if(toupper(s[nBegin])==toupper(s[nEnd]))
		{
			++nBegin;
			--nEnd;
		}
		else //不等
		{
			return  false;
		}

	}

	if(nBegin<nEnd)
	{
		return  false;
	}
	else
	{
		return  true;
	}
}

};