设为首页 加入收藏

TOP

[LeetCode OJ 007]Reverse Integer
2015-11-21 00:55:02 来源: 作者: 【 】 浏览:1
Tags:LeetCode 007 Reverse Integer

?

题目:

Reverse digits of an integer.

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

Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

示例代码:

?

public class Solution 
{
     public int reverse(int x) 
	 {
		 if(x==0)
			 return 0;
		 int value=Math.abs(x);
		 long result=0;
		 int m=value;
		 while(m>0)
		 {
			 result=result*10+m%10;
			 m=m/10;
		 }
		 if (result > 2147483647) 
			 return 0;
		 if(x>0)
			 return (int)result;
		 else
			 return (int)-result;
	 }
}


?

】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇LeetCode 27 Remove Element(移.. 下一篇poj1155 TELE(树形dp+背包)

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: