算法分析与设计作业

算法分析与设计作业题

Palindrome Number

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Example 1:

Input: 121
Output: true
Example 2:

Input: -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
Example 3:

Input: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

class Solution {
public:
    bool isPalindrome(int x) {
        if(x==0)
            return true;
        bool p = (x>0);
            if(!p)
            return false;
        int num[10];
        int t=0;
        while(x){
            num[t++] = x%10;
            x/=10;
        }
        for(int i=0;i<t/2;++i){
            if(num[i]!=num[t-1-i])
                return false;
        }
        return true;
    }
};