[leetcode] Valid Palindrome

From : 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.

class Solution{
public:
	bool isPalindrome(string s) {
		int start=0, end=s.size();
		char sc, ec;
		while(start < end) {
			sc = s[start];
			ec = s[end];
			while(start<end && !(sc>='0' && sc<='9' || sc>='a' && sc<='z' || sc>='A' && sc<='Z')) 
			{start++; sc=s[start];}
			while(start<end && !(ec>='0' && ec<='9' || ec>='a' && ec<='z' || ec>='A' && ec<='Z'))
			{end--; ec=s[end]; }
			if(start >= end) return true;
			start++;
			end--;
			if((sc>='a' && sc<='z' || sc>='A' && sc<='Z') && (ec>='a' && ec<='z' || ec>='A' && ec<='Z')) {
				if(sc==ec || sc-'a'+'A'==ec || sc-'A'+'a'==ec) continue;
				else return false;
			}
			if(sc != ec) return false;
		}
		return true;
	}
};

public class Solution {
	public boolean isPalindrome(String s) {
		if (s == null) {
			return true;
		}
		int start = 0, end = s.length() - 1;
		char sc, ec;
		while (start < end) {
			sc = s.charAt(start);
			ec = s.charAt(end);
			while (start < end && !(isAlphanumeric(sc))) {
				++start;
				sc = s.charAt(start);
			}
			while (start < end && !(isAlphanumeric(ec))) {
				--end;
				ec = s.charAt(end);
			}
			if (start >= end){
				return true;
			}
			sc = Character.toLowerCase(sc);
			ec = Character.toLowerCase(ec);
			if (sc != ec) {
				return false;
			}
			start++;
			end--;
		}
		return true;
	}

	private boolean isAlphanumeric(char c) {
		return c >= '0' && c <= '9' || c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z';
	}
}