LeetCode 9 Polindrome Number

这个题的坑：所有的负数都看做不是Polindrome Number

#include <iostream>
using namespace std;

class Solution {
public:
    bool isPalindrome(int x) {
        if (x < 0)
            return false;
        int nums[100];
        int copy = x;
        int i = 0;
        int len;
        bool result = true;
        for (;copy != 0; copy /= 10) {
            int r;
            r = copy % 10;
            nums[i] = r;
            i++;
        }
        len = i;
        for (i = 0; i < len/2; i++) {
            if (nums[i] != nums[len-1-i]) {
                result = false;
                break;
            }
        }
        return result;
    }
};

int main() {
    int testNum;
    bool result;
    Solution s;
    cout << "Test Number: ";
    cin >> testNum;
    result = s.isPalindrome(testNum);
    cout << (result?1:0) << endl;
}