Algorithm Puzzles: String to Integer (atoi)

Posted on Edited on In Views: Word count in article: 563 Reading time ≈ 2 mins.

Algorithm Puzzles everyday every week sometimes: String to Integer (atoi)

Puzzle

Puzzle from leetcode:

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:

1
2
Input: "42"
Output: 42

Example 2:

1
2
3
4
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:

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

Example 4:

1
2
3
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:

1
2
3
4
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.

Solution

My first solution is using regex to filtrate incorrect inputs and find out the numerical:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
class Solution {
  public:
    int myAtoi(const std::string& str) {
        const int intMin = -2147483648;
        const int intMax = 2147483647;
        if (std::regex_match(str, std::regex("[ ]*[-+]?\\d{1,}[\\s\\S]*"))) {
            std::smatch numMatch;
            std::regex_search(str, numMatch, std::regex("[-+]?\\d{1,}"));

            int index = 0, res = 0;
            int negative = 1;

            if (numMatch[0].str()[0] == '-') {
                negative = -1;
                index = 1;
            } else if (numMatch[0].str()[0] == '+') {
                index = 1;
            }

            for (; index < numMatch[0].str().length(); ++index) {
                if (res > 214748364 ||
                    (res == 214748364 && numMatch[0].str()[index] - '0' > 7)) {
                    return negative == -1 ? intMin : intMax;
                }
                res = res * 10 + (numMatch[0].str()[index] - '0');
            }
            return res * negative;
        }
        return 0;
    }
};

Then :

I realized that maybe using regex is not a good idea since there is no need to traversal string more than once… After some modification, here is my solution 2:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
class Solution {
  public:
    int myAtoi(const string& str) {
        const int intMin = -2147483648;
        const int intMax = 2147483647;

        size_t index = 0;
        size_t length = str.length();
        int res = 0;
        bool negative = false;

        index = str.find_first_not_of(' ');

        if (index == std::string::npos) {
            return 0;
        }

        if (str[index] < '0' || str[index] > '9') {
            if (str[index] == '-') {
                negative = true;
                ++index;
            } else if (str[index] == '+') {
                ++index;
            } else {
                return 0;
            }
        }

        for (; index < length; ++index) {
            if (str[index] < '0' || str[index] > '9') {
                break;
            }
            if (res > 214748364 ||
                (res == 214748364 && (str[index] - '0' > 7))) {
                return negative ? intMin : intMax;
            }
            res = res * 10 + (str[index] - '0');
        }
        return negative ? -res : res;
    }
};

Result I got:

0 ms and better than 100%…