zoukankan      html  css  js  c++  java
  • 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.


    非常easy的一道题。

    例如以下:

    public class Solution {
        public int reverse(int x) {
          if(x == 0){
              return 0;
          }
          int fuhao = x >> 31 & 1;//1为负数
          if(fuhao == 1){
              x = -x;//转换成正数 
          }
          StringBuffer sb = new StringBuffer();
          while(x > 0){
              sb.append(x%10);
              x /= 10;
          }
          try{
            x = Integer.parseInt(sb.toString());
          }catch(Exception ex){
              return 0;//转换之后的数据溢出
          }
          if(fuhao == 1){
              x = -x;
          }
          return x;
        }
    }

    Runtime: 256 ms

    注意题后的特殊情况,一个正常的数转换后可能出错,如input为1534236469,则retrun 0;

    參考别人的代码,发现自己的思维固定在了Sstring上了,改进例如以下:

    public class Solution {
        public int reverse(int x) {
          if(x == 0){
              return 0;
          }
          int fuhao = x >> 31 & 1;//1为负数
          if(fuhao == 1){
              x = -x;//转换成正数 
          }
          long x1 = 0;
          while(x > 0){
              x1 = x1 * 10 + x%10;
              x /= 10;
          }
          if(x1 > Integer.MAX_VALUE || x1 < Integer.MIN_VALUE){//转换失败
              return 0;
          }
          if(fuhao == 1){
              x = -(int)x1;
          }else{
              x = (int)x1;
          }
          return x;
        }
    }

    Runtime: 217 ms

  • 相关阅读:
    函数——返回值不止一个的情况(解一元二次方程)
    排序方法:去掉最高最低分求平均分 函数
    丢羊 递归
    网吧充值 函数+Swich+ArrayList版
    对战游戏自己简单版+大神版
    简单Struct+ArrayList选择买东西:购物车思路
    推箱子 复杂版(多个箱子)
    stuct+ArrayList的for用法
    Struct+ArrayList冒泡排序。例
    c# 穷举
  • 原文地址:https://www.cnblogs.com/yxwkf/p/4514277.html
Copyright © 2011-2022 走看看