LeetCode

String to Integer (atoi)

2014.2.10 02:23

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.

spoilers alert... click to show requirements for 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.

Solution:

　　atoi() is a function declared in <stdio.h>, which converts a C-style string to integer. The "Requirements for atoi" has specified every detail you need before starting coding. Actually you shouldn't expect such detailed specification in written text, but from the mouth of the interviewer, when you're facing a real technical interview.

　　The next job is to finish the problem with your code being as simple as possible. Perhaps I could do better, but this one below is enough to get an AC from LeetCode OJ.

　　Note that the conversion ends when an invalid character is encountered.

　　Time complexity is O(n), where n is the length of the string. Space complexity is O(1).

Accepted code:

// 2CE, 1RE, 1TLE, 2WA, 1AC, never write your code in a hurry.
#include <climits>
#include <cstring>
using namespace std;

class Solution {
public:
    int atoi(const char *str) {
        int i, len;
        int flag;
        long long int result = 0;
        
        if (str == NULL) {
            return result;
        } else if (str[i] == '-') {
            flag = -1;
            ++i;
        } else if (str[i] == '+') {
            flag = +1;
            ++i;
        } else {
            flag = +1;
        }
        
        long long int int_min, int_max;
        
        int_min = INT_MIN;
        int_max = INT_MAX;
        while (i < len) {
            if (s[i] >= '0' && s[i] < '9') {
                result = result * 10 + (s[i] - '0');
                if (flag == -1) {
                    if (-result < int_min) {
                        // underflow
                        return int_min;
                    }
                } else {
                    if (result > int_max) {
                        // overflow
                        return int_max;
                    }
                }
            }
            ++i;
        }
        
        return flag * result;
    }
};