[leetcode_9]Palindrome Number

This problem is simple: determine whether an int is a palindrome.

Note that negative numbers are not palindromes. Just convert the int to a character array and check directly.

Accepted on the first try.

 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
class Solution {
public:
    bool isPalindrome(int x) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(x < 0)
            return false;
        char s[100];
        int index = 0;
        while(x > 0)
        {
            s[index++] = x%10;
            x /= 10;
        }
        int i = 0;
        int j = index-1;
        while(i <= j)
        {
            if(s[i] != s[j])
                return false;
            i++;
            j--;
        }
        return true;
    }
};