LeetCode8. String to Integer (atoi)

题目

Implement atoi to convert a string to an integer.

Requirements for atoi:
The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from this character, takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value.

The string can contain additional characters after those that form the integral number, which are ignored and have no effect on the behavior of this function.

If the first sequence of non-whitespace characters in str is not a valid integral number, or if no such sequence exists because either str is empty or it contains only whitespace characters, no conversion is performed.

If no valid conversion could be performed, a zero value is returned. If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is returned.

简单说就是把字符串转化为对应整数返回,超出int的表示范围则返回int的最大最小值,字符串不合要求则返回零。
并且只要前面出现的第一段字符能转为int,即使后面再出现其他字符也没关系,只需要把前面转为int的返回。

思路

对字符串的检测方法和上一题Valid Number类似

只需要增加string转化为int,和判断数据是否超出int的边界的代码

一边扫描一边转化为int,转化前需要先判断是否超出int表示范围

for(;str[i] <= '9' && str[i] >= '0' && i < str.length(); i++) {
            n_nm++;
            if (num > (INT_MAX - (str[i] - '0')) / 10) {
                return sign == -1? INT_MIN: INT_MAX;
            }//即转化后的 num * 10 + (str[i] - '0') 不能大于 INT_MAX

            num = num * 10 + (str[i] - '0');
        }

代码

class Solution {
public:
    int myAtoi(string str) {
        if(str.empty()) return 0;

        int num = 0;

        int sign = 1;

        int i = 0;

        int n_nm = 0;

        bool outRange = false;

        while(str[i] == ' ') i++; 

        if(i < str.length() && (str[i] == '+' || str[i] == '-')) {
            sign = (str[i] == '-')? -1: 1;
            i++;
        }

        for(;str[i] <= '9' && str[i] >= '0' && i < str.length(); i++) {
            n_nm++;
            if (num > (INT_MAX - (str[i] - '0')) / 10) {
                return sign == -1? INT_MIN: INT_MAX;
            }

            num = num * 10 + (str[i] - '0');
        }

        if(n_nm < 1) return 0;

        return num * sign;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值