LeetCode【7】.Reverse Integer--java實現

標籤：leetcode   java   演算法   string   

Reverse Integer

題目要求：給定一個int 類型值，求值的反轉，如下：

     Example1: x = 123, return 321
     Example2: x = -123, return -321

     簡單問題一般蘊含細節的處理。思路很簡單，直接貼Java程式：

public class Solution {    public int reverse(int x) {                int head = x/10;        int tail = x%10;        long re = 0;                while(head!=0||tail!=0)        {            re = re*10 + tail;            tail = head%10;            head = head/10;        }                re = re < Integer.MIN_VALUE? 0:re;        re = re > Integer.MAX_VALUE? 0:re;                return (int)re;    }}

LeetCode【7】.Reverse Integer--java實現