leetcode--Reverse Integer

本文介绍了一种用于反转整数的Java算法实现,并考虑了溢出处理等问题,适用于32位整数的反转。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Reverse digits of an integer.

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

click to show spoilers.

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.

[java]  view plain  copy
  1. public class Solution {  
  2.     public int reverse(int x) {               
  3.         long r = 0;//注意这里设置为long      
  4.         while(x!=0){//这里是不等于0,从而可以处理正负数两种情况                   
  5.             r = 10*r+x%10;  
  6.             x /= 10;              
  7.         }         
  8.           
  9.         if(r > Integer.MAX_VALUE || r < Integer.MIN_VALUE){  
  10.             return 0;  
  11.         }  
  12.         return (int)r;  
  13.     }  

原文链接http://blog.youkuaiyun.com/crazy__chen/article/details/45456919

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值