[Leetcode] Valid palindrome

The suggested solution to this problem have given a clear idea. The tricky part of this problem are to handle all the edge cases carefully and write a clean code.

The following code should is self-explanatory. Note that the use of toupper avoid some messy if-else statements.

1 classSolution {2  Public:3     BOOLIspalindrome (strings) {4         intL =0, r = s.length ()-1;5          while(L <r) {6              while(L < R &&!isalnum (S[l])) l++;7             if(L >= R) Break;8              while(R > L &&!isalnum (S[r])) r--;9             if(ToUpper (s[l++])! = ToUpper (s[r--]))Ten                 return false; One         } A         return true; -     } -};

[Leetcode] Valid palindrome