8. String to Integer (atoi)

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.

 

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.

自己实现一个atoi函数,注意可能有很多前导‘ ’, 如果是整数前面可以有+,也可以没有,如果是负数会有-,然后接下来如果是数字,那就累加到不是数字为止,还有一个要判断的点是,如果超过了整型范围INT_MAX, INT_MIN,那么就返回整型范围的上下界。

所以return值res要设为long,不能是int,要记得在累加数字时就判断是否超过整型范围,如果全部计算完,很难判断是超出整型范围还是超出long范围,很麻烦。

代码如下:

class Solution {
public:
    //remove whitespace characters until first non-whitespace character
    //sign
    //non numeric characters will be ignored after the integer
    //str is empty or all whitespace will return 0
    //if the value is out of integer range return INT_MAX or INT_MIN
    int myAtoi(string str) {
        if (str.size() == 0) return 0;
        long long res = 0;
        bool negative = false;
        int i = 0;
        while(str[i] == ' ') i++;
        
        if (str[i] == '-') {
            negative = true;
            i++;
        }
        else if (str[i] == '+') i++; //"+1"
        
        while (str[i] >='0' && str[i] <='9') {
            res *= 10;
            res += str[i] - '0';
            i++;
            if (res > INT_MAX) {//这里判断,记住这时候还没有改变sign
                if (negative == true) return INT_MIN;
                else return INT_MAX;
            }
            
        }
        if (res == 0) return 0;
        if (negative == true) res = -res;
        return res;
    }
};

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值