[leetcode]-125. Valid Palindrome（C语言）

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.

Note: For the purpose of this problem, we define empty string as valid palindrome.

Example 1:

Input: "A man, a plan, a canal: Panama"
Output: true

Example 2:

Input: "race a car"
Output: false

bool isPalindrome(char* s) {
    int len=strlen(s),i=0,j=len-1;
    if(len==0||len==1)
        return true;
    while(i<j)
    {
        if(s[i]>='A'&&s[i]<='Z'||s[i]>='a'&&s[i]<='z'||s[i]>='0'&&s[i]<='9')
        {
            if(s[i]>='A'&&s[i]<='Z')
                s[i]=s[i]+32;
        }
        else
        {
            i++;
            continue;
        }
        if(s[j]>='A'&&s[j]<='Z'||s[j]>='a'&&s[j]<='z'||s[j]>='0'&&s[j]<='9')
        {
            if(s[j]>='A'&&s[j]<='Z')
                s[j]=s[j]+32;
        }
        else
        {
            j--;
            continue;
        }
        if(s[i]!=s[j])
            return false;
        i++;
        j--;
    }
    return true;
}