LeetCode 刷题记录 8. String to Integer (atoi)

时间:2019-04-19
本文章向大家介绍LeetCode 刷题记录 8. String to Integer (atoi),主要包括LeetCode 刷题记录 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.
方法:
先处理空格,然后处理正负号,最后处理字符串,如果遇见非法字符就退出,注意溢出处理
c++:

class Solution {
public:
    int myAtoi(string str) {
        int num = 0;
        int sign = 1;
        int i = 0;
        int n = str.size();
        while(i < n && str[i] == ' ') i++;
        if(i < n && str[i] == '+'){
            i++;
        } else if(i < n && str[i] == '-'){
            sign = -1;
            i++;
        }
        for(; i < n; i++){
            if(str[i] < '0' || str[i] > '9') break;
            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');
        }
        return sign * num;
    }
};

java:

class Solution {
    public int myAtoi(String str) {
        int num = 0;
        int sign = 1;
        int i = 0;
        int n = str.length();
        while(i < n && str.charAt(i) == ' ') i++;
        if(i < n && str.charAt(i) == '+'){
            i++;
        } else if(i < n && str.charAt(i) == '-'){
            sign = -1;
            i++;
        }
        for(; i < n; i++){
            if(str.charAt(i) < '0' || str.charAt(i) > '9') break;
            if(num > Integer.MAX_VALUE / 10 || (num == Integer.MAX_VALUE / 10 && (str.charAt(i) - '0') > Integer.MAX_VALUE % 10)){
                return sign == -1 ? Integer.MIN_VALUE : Integer.MAX_VALUE;
            }
            num = num * 10 + (str.charAt(i) - '0');
        }
        return sign * num;
    }
}

python:
注意在去除空格后 判断是否为空 防止越界错误

class Solution(object):
    def myAtoi(self, str):
        """
        :type str: str
        :rtype: int
        """
        
        ls = list(str.strip())
        if len(ls) == 0: return 0
        sign = -1 if ls[0] == '-' else 1
        if ls[0] in ['+', '-']: del ls[0]
        ans, i = 0, 0
        while i < len(ls) and ls[i].isdigit():
            ans = ans * 10 + ord(ls[i]) - ord('0')
            i += 1
        if sign * ans > 2**31 -1:
            return 2**31 - 1
        elif sign * ans < -2**31:
            return -2**31
        else: return sign * ans