Tag Archives: atoi

LeetCode String to Integer (atoi)

8. String to Integer (atoi)

Implement atoi which converts a string to an integer.

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.

Note:

  • Only the space character ' ' is considered as whitespace character.
  • Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. If the numerical value is out of the range of representable values, INT_MAX (231 − 1) or INT_MIN (−231) is returned.

Example 1:

Input: "42"
Output: 42

Example 2:

Input: "   -42"
Output: -42
Explanation: The first non-whitespace character is '-', which is the minus sign.
             Then take as many numerical digits as possible, which gets 42.

Example 3:

Input: "4193 with words"
Output: 4193
Explanation: Conversion stops at digit '3' as the next character is not a numerical digit.

Example 4:

Input: "words and 987"
Output: 0
Explanation: The first non-whitespace character is 'w', which is not a numerical 
             digit or a +/- sign. Therefore no valid conversion could be performed.

Example 5:

Input: "-91283472332"
Output: -2147483648
Explanation: The number "-91283472332" is out of the range of a 32-bit signed integer.
             Thefore INT_MIN (−231) is returned.

这题要求我们手动实现由string转换为int的atoi函数。当然有很多细节需要考虑,不过你可以一步一步来,先实现常见的case,然后看看出错样例,再逐步完善自己的算法。 错了几次之后,我看了atoi函数的介绍,上面并没有说明如果数值超过int的表示范围应该怎么处理:

If the converted value would be out of the range of representable values by an int, it causes undefined behavior. Seestrtol for a more robust cross-platform alternative when this is a possibility.

不过strtol函数提到如果超出long表示范围则返回最大值或最小值,所以在实现atoi时我也是这么做的。 算法过程是:首先去除前导空白字符(如空格),如果剩余字符串长度为0或者1,则特殊处理;判断有无符号位;然后对字符依次处理,直到遇到一个非数字字符,break;最后检查是否超出int范围以及符号位。 完整代码如下:

class Solution {
public:
    int myAtoi(string str)
    {
        int i = 0;
        while (i < str.size() && str[i] == ‘ ‘)
            i++;
        string tmp = str.substr(i);
        if (tmp.size() == 0 || (tmp.size() == 1 && (tmp[0] < ‘0’ || tmp[0] > ‘9’)))
            return 0;
        string digits = (tmp[0] == ‘-‘ || tmp[0] == ‘+’) ? tmp.substr(1) : tmp;
        double ans = 0;
        for (int i = 0; i < digits.size(); i++)
            if (digits[i] < ‘0’ || digits[i] > ‘9’)
                break;
            else
                ans = ans * 10 + (digits[i] – ‘0’);
        ans = (tmp[0] == ‘-‘) ? -ans : ans;
        if (ans > INT_MAX)
            return INT_MAX;
        else if (ans < INT_MIN)
            return INT_MIN;
        else
            return ans;
    }
};

本代码提交AC,用时8MS,居然击败了75%的CPP用户:-)

二刷。如果不用double存储结果的话,可以和LeetCode Reverse Integer类似处理,即在转换的过程中判断是否超过int表示范围。不过有点奇怪的是,如果字符串表示的值就是INT_MAX的话,ans=ans*10+digit会运行时错误,大概意思是说ans是int,无法存储INT_MAX?挺奇怪的,所以把>7改成>=7。

class Solution {
public:
	bool isDigit(char c) {
		return c >= '0'&&c <= '9';
	}
	int myAtoi(string str) {
		int ans = 0;
		bool neg = false;
		int i = 0, n = str.size();
		while (str[i] == ' '&&i < n)++i;
		if (i < n) {
			if (str[i] == '-') {
				neg = true;
				++i;
			} else if (str[i] == '+')++i;
			while (i < n&&isDigit(str[i])) {
				int digit = str[i] - '0';
				if (!neg && (ans > INT_MAX / 10 || (ans == INT_MAX / 10 && digit >= 7)))return INT_MAX;
				if (neg && (-ans < INT_MIN / 10 || (-ans == INT_MIN / 10 && digit >= 8)))return INT_MIN;
				ans = ans * 10 + digit;
				++i;
			}
		}
		if (neg)ans = -ans;
		return ans;
	}
};

本代码提交AC,用时4MS。