LeetCode8-String to Integer (atoi)(C++)

Description

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.

AC代碼

long long int res = 0;
        string str_copy = str;
        bool sign = false;

        while(str_copy[0] == ' ') {
            str_copy.erase(str_copy.begin());
        }

        if((str_copy[0] == '-') || (str_copy[0] == '+')) {
            if(str_copy[0] == '-') {
                sign = true;
            }
            str_copy.erase(str_copy.begin());
        }

        for(char ch : str_copy) {
            if((ch > '9') || (ch < '0')) {
                break;
            }
            res = res*10 + (ch - '0');
            if(res > INT_MAX) {
                return (sign ? INT_MIN : INT_MAX);
            }
        }
        
        if(sign) {
            res *= -1;
        }
        return res;

測試代碼

int main() {
    Solution s;
    string a = "123";
    string b = "+456";
    string c = "-789";
    string d = "pYin342";
    string e = "233ewrw";

    cout << s.myAtoi(a) << endl;
    cout << s.myAtoi(b) << endl;
    cout << s.myAtoi(c) << endl;
    cout << s.myAtoi(d) << endl;
    cout << s.myAtoi(e) << endl;
}

總結

處理這個問題的關鍵思路就是,將每一位有效字符剝離出來,減去’0’,得到的就是該字符的整數值。需要注意兩個額外的條件,一是不能超出32位整數的範圍,二是前面的如何空格如何移除。

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章