LeetCode/125.cpp at master · nitin-maharana/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

class Solution {
    int len;
public:
    bool isPalindrome(string s) {
        len = s.length();

        int l, r;

        l = 0;
        r = len - 1;

        while(l < r)
        {
            if(isalnum(s[l]) && isalnum(s[r]))
            {
                if(tolower(s[l]) == tolower(s[r]))
                {
                    l++;
                    r--;
                    continue;
                }
                else
                    return false;
            }

            if(!isalnum(s[l]))
                l++;

            if(!isalnum(s[r]))
                r--;
        }

        return true;
    }
};