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.

Follow up:
Coud you solve it without converting the integer to a string?

注:直接用栈和队列做的,时间复杂度有点大。Runtime: 120 ms, faster than 48.36% of C online submissions for Palindrome Number. 等有时间再想想好的办法。

bool isPalindrome(int x) {
    //声明栈和队列
    int stack[100];
    int top = 0;
    int que[100];
    int rear = 0,front = 0;
    int temp;
    
    if(x < 0)
        return false;
    while(x > 0){
        que[++rear] = x%10;
        stack[++top] = x%10;
        x = x/10;
    }
    int j = top;
    for(int i = 0; i < j; ++i){
        if(que[++front] != stack[top--]){
            return false;
        }
    }
    return true;    
}
©️2020 CSDN 皮肤主题: 技术黑板 设计师:CSDN官方博客 返回首页