LeetCode 8. String to Integer (atoi)

https://leetcode.com/problems/string-to-integer-atoi/description/

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.

Update (2015-02-10):
The signature of the C++ function had been updated. If you still see your function signature accepts a const char * argument, please click the reload button  to reset your code definition.

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.

• 字符串简单题，主要是注意细节，看定义里时如何处理输入字符串的。判断不规则但是有效输入，无效格式，溢出数据。处理溢出数据时，要注意判断条件。
• 判断溢出时需要注意 abs(INT_MIN) (-2147483648) > abs(INT_MAX) (2147483647)。
• 两种解法思想一样，就是第一种用了isdigit()判断数字，更简洁。
• atoi - C++ Reference
  • http://www.cplusplus.com/reference/cstdlib/atoi/
• isdigit - C++ Reference
  • http://www.cplusplus.com/reference/cctype/isdigit/

//
//  main.cpp
//  LeetCode
//
//  Created by Hao on 2017/3/16.
//  Copyright © 2017年 Hao. All rights reserved.
//

#include <iostream>
#include <cstring>
#include <vector>
using namespace std;

class Solution {
public:
    int myAtoi(string str) {
        int i = 0;
        int result = 0;
        
        if (str.empty()) return 0;
        
        while (' ' == str.at(i) && i < str.size()) ++ i;
        
        if (i == str.size()) return 0;
        
        int sign = 1;
        
        if ('+' == str.at(i)) {
            sign = 1;
            ++ i;
        } else if ('-' == str.at(i)) {
            sign = -1;
            ++ i;
        }
        
        while (i < str.size() && isdigit(str.at(i))) {       // isdigit() from <cctype>
            if (result > (INT_MAX - (str.at(i) - '0')) / 10) // use > instead of >= for that abs(INT_MIN) (-2147483648) > abs(INT_MAX) (2147483647)
                return -1 == sign ? INT_MIN : INT_MAX;
            
            result = result * 10 + (str.at(i) - '0');
            
            ++ i;
        }
        
        return result * sign;
    }
    
    int myAtoi2(string str) {
        int num = 0;
        int sign = 1;
        int i = 0;
        const int n = str.length();
        
        if (n == 0) return 0;
        
        while ((str[i] == ' ') && (i < n))
            i ++;
        
        if (str[i] == '+')
            i ++;
        else if (str[i] == '-') {
            sign = -1;
            i ++;
        }
        
        while (i < n) {
            if (str[i] < '0' || str[i] > '9')
                break;
            
            // Be careful for out of range value
            if ((num > INT_MAX / 10) || ((num == INT_MAX / 10) && ((str[i] - '0') > INT_MAX % 10)))
                return sign == -1 ? INT_MIN : INT_MAX;
            
            num = num * 10 + (str[i] - '0');
            
            i ++;
        }
        
        return num * sign;
    }
};

int main(int argc, char* argv[])
{
    Solution    testSolution;
    string      result;
    
    vector<string> sVec = {"      -11919730356x", "", "1", "-2147483648", "-2147483647", "2147483647", "2147483648", "-3924x8fc", "+ 413", "++c", " ++1", "+413"};
    
    /*
     -2147483648
     0
     1
     -2147483648
     -2147483647
     2147483647
     2147483647
     -3924
     0
     0
     0
     413
     */
    for (auto s : sVec) {
        cout << testSolution.myAtoi(s) << endl;
        cout << testSolution.myAtoi2(s) << endl;
    }

    return 0;
}