(LEEDCODE)String to Integer (atoi) 字符串转整型

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.


1. 首先需要丢弃字符串前面的空格;

2. 然后可能有正负号(注意只取一个,如果有多个正负号,那么说这个字符串是无法转换的,返回0。比如测试用例里就有个“+-2”);

3. 字符串可以包含0~9以外的字符,如果遇到非数字字符,那么只取该字符之前的部分,如“-00123a66”返回为“-123”;

4. 如果超出int的范围,返回边界值(2147483647或-2147483648)。

因为可能超出int的界限,所以result可以是double(8个字节)型的变量
C++:
int Solution::myAtoi(string str) {

    //判断空
    if(str.empty() || str.length() == 0)
        return 0;

    //去首尾空格
    str.erase(0,str.find_first_not_of(" "));
    str.erase(str.find_last_not_of(" ") + 1);

    //判断正负
    bool positive = true;
    int i = 0;
    if(str[i] == '-'){
        positive = false;
        i++;
    }else if(str[i] == '+'){
        i++;
    }

    //读数
    double result = 0;
    for( ; i < str.length(); i++ ){
        int temp = str[i] - '0';

        if(temp < 0 || temp >9 )
            break;

        if (positive){
            result = result * 10 + temp;
//            if(result > INT_MAX/10)
//                return INT_MAX;
        }else {
            result = result * 10 - temp;
//            if(result < INT_MIN/10)
//                return INT_MIN;
        }
    };

    //判断是否超界限
    if(result > INT_MAX || result < INT_MIN){
        if(positive)
            return INT_MAX;
        else
            return INT_MIN;
    }

    return (int)result;
}





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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值