leetcode: 8. String to Integer (atoi)

6 篇文章 0 订阅
5 篇文章 0 订阅

一. 题目描述:

Implement atoi to convert a string to an integer.

Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.

Notes: It is intended for this problem to be specified vaguely (ie, no given input specs). You are responsible to gather all the input requirements up front.

Update (2015-02-10):
The signature of the C++ function had been updated. If you still see your function signature accepts a const char * argument, please click the reload button  to reset your code definition.

spoilers alert... click to show requirements for atoi.

二. 思路:

  • 字符串为空时返回0
  • 若字符串非空,使用trim方法去掉字符串的前后空格
  • 从字符串的第一个数字字符开始将去掉前后空格的字符串转化成数字,当字符串的第一个字符是正号或者负号的时候,开始转化的字符的索引值为1,否则,索引值为0
  • 转化的过程中检查转化结果(由于该结果可能溢出,所以使用long类型来存储)是不是超过了int最大能表示的范围,若超过则转化停止,否则继续将后续的字符转化成整数
  • 检查转化后的结果,若结果大于Integer.MAX_VALUE,返回Integer.MAX_VALUE;若结果小鱼Integer.MIN_VALUE,返回Integer.MIN_VALUE;其他的情况,直接将转化后的结果强转成int返回即可

三. 代码:

public class Solution {
    public int myAtoi(String str) {
        // trime leading and tailing spaces 
        str = str.trim();

        // if the lenght of stri is 0 or the first character of str is not reasonable, return 0 directly
        if (str.length() == 0){
            return 0;
        }

        int begin = 0;                                              // the index of first digit
        int sign = 1;                                               // the sign of the number. 1 represent the number is positive, or negative 
        if (str.charAt(0) == '-'){
            sign = -1;
            begin = 1;
        } else if (str.charAt(0) == '+'){
            begin = 1;
        }

        long sum = 0;                                               // handle integer overflow
        for (int i = begin; i < str.length(); i++){
            char ch = str.charAt(i);

            if (ch < '0' || ch > '9'){                                      // if the ch is not reasonable char, break the loop
                break;
            }

            sum = 10 * sum + (ch - '0');

            if (sum > Integer.MAX_VALUE){
                break;
            }

        }

        sum = sign == 1 ? sum : -sum;
        if (sum > Integer.MAX_VALUE){
            return Integer.MAX_VALUE;
        } else if (sum < Integer.MIN_VALUE){
            return Integer.MIN_VALUE;
        }

        return (int)sum;
    }

}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值