leetcode 7.Reverse Integer

题目

Given a 32-bit signed integer, reverse digits of an integer.

Example 1:

Input: 123
Output: 321
Example 2:

Input: -123
Output: -321
Example 3:

Input: 120
Output: 21
Note:
Assume we are dealing with an environment which could only hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

解（没有判断范围）

class Solution {
    public int reverse(int x) {
//         int ret=0;

//         //if(x>Integer.MAX_VALUE || x<Integer.MIN_VALUE){
//             //return 0;
//         //}
//         if( x>0x7fffffff || x<0x80000000){
//             return 0;
//         }

        ArrayList<Integer> aList=new ArrayList<Integer>();       
        while(x!=0){
            aList.add(x%10);
            x=x/10;
        }

        int i=0;
        for(;i<aList.size()-1;i++){
            ret=(ret+aList.get(i))*10;
        }
        ret=ret+aList.get(i);

        return ret;

    }
}

正解

class Solution {
    public int reverse(int x) {
    int result = 0;

    while (x != 0)
    {
        int tail = x % 10;
        int newResult = result * 10 + tail;
        if((newResult - tail) / 10 != result){
            return 0;
        }
        result = newResult;
        x = x / 10;
    }

    return result;

    }
}

小结

1. 只考虑到常规解法，特殊情况下，应考虑特殊的解法。