8. String to Integer (atoi)

本文介绍如何实现字符串转整数的atoi方法,包括处理前导空格、符号位、溢出及非法输入等问题,提供了一个简洁的C++实现。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

问题描述

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.

题目链接:


思路分析

实现string转int的atoi()方法。

一道很操蛋的题目,我们需要考虑四种情况:1.字符前面有空格;2.符号位;3.溢出;4.非法输入(++-93)。

依次解决,跳过空格;判断符号位;设置循环条件(string最后一位是‘/n’,其他的非法输入也不会触发循环;判断溢出,是否大于INT_MAX的十分之一或者正好大于一丢丢。

代码
class Solution {
public:
    int myAtoi(string str) {
        int n = str.size();
        if (n == 0)
            return 0;
        int i = 0, base = 0, sign = 1;
        while (str[i] == ' ') i++;
        if (str[i] == '+' || str[i] == '-')
            sign = str[i++] == '+' ? 1 : -1;
        while (str[i] >= '0' && str[i] <= '9') {
        if (base >  INT_MAX / 10 || (base == INT_MAX / 10 && str[i] - '0' > 7)) {
            if (sign == 1) return INT_MAX;
            else return INT_MIN;
            }
        base  = 10 * base + (str[i++] - '0');
        }
        return sign * base;
    }
};

时间复杂度: O(n) O ( n )
空间复杂度: O(1) O ( 1 )


反思

不要忘记了i++,在while循环中可以写在合适的地方,代码更加简洁。另外这个题b事实在是太多了。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值