【LeetCode】 8. String to Integer (atoi) 字符串转换整数 (atoi)（Medium）（JAVA）
题目地址: https://leetcode.com/problems/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: [−2^31, 2^31 − 1]. If the numerical value is out of the range of representable values, INT_MAX (2^31 − 1) or INT_MIN (−2^31) 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 (−2^31) is returned.
题目大意
请你来实现一个 atoi 函数，使其能将字符串转换成整数。
首先，该函数会根据需要丢弃无用的开头空格字符，直到寻找到第一个非空格的字符为止。
当我们寻找到的第一个非空字符为正或者负号时，则将该符号与之后面尽可能多的连续数字组合起来，作为该整数的正负号；假如第一个非空字符是数字，则直接将其与之后连续的数字字符组合起来，形成整数。
该字符串除了有效的整数部分之后也可能会存在多余的字符，这些字符可以被忽略，它们对于函数不应该造成影响。
注意：假如该字符串中的第一个非空格字符不是一个有效整数字符、字符串为空或字符串仅包含空白字符时，则你的函数不需要进行转换。
在任何情况下，若函数不能进行有效的转换时，请返回 0。
说明：
假设我们的环境只能存储 32 位大小的有符号整数，那么其数值范围为 [−2^31, 2^31 − 1]。如果数值超过这个范围，请返回 INT_MAX (2^31 − 1) 或 INT_MIN (−2^31) 。
解题方法
1、首先去掉开头的空格
2、判断正还是负
3、不断循环取出数字组成整数，直到结尾或者遇到非数字
note: 类似 【LeetCode】 7. Reverse Integer 整数反转（Easy）（JAVA），同样要考虑 int 超限
add && (res > Integer.MAX_VALUE / 10 || (res == Integer.MAX_VALUE / 10 && (temp - ‘0’) > 7))
!add && (res > Integer.MAX_VALUE / 10 || (res == Integer.MAX_VALUE / 10 && (temp - ‘0’) > 8))
class Solution {
public int myAtoi(String str) {
if (str.length() == 0) return 0;
int res = 0;
int i = 0;
while (i < str.length() && str.charAt(i) == ' ') {
i++;
}
if (i >= str.length()) return 0;
boolean add = true;
char temp = str.charAt(i);
if (temp == '+') {
add = true;
i++;
} else if (temp == '-') {
add = false;
i++;
} else if (temp < '0' || temp > '9') {
return 0;
}
for (; i < str.length(); i++) {
temp = str.charAt(i);
if (temp < '0' || temp > '9') break;
if (add && (res > Integer.MAX_VALUE / 10 || (res == Integer.MAX_VALUE / 10 && (temp - '0') > 7))) return Integer.MAX_VALUE;
if (!add && (res > Integer.MAX_VALUE / 10 || (res == Integer.MAX_VALUE / 10 && (temp - '0') > 8))) return Integer.MIN_VALUE;
res = res * 10 + temp - '0';
}
return res * (add ? 1 : -1);
}
}
执行用时 :2 ms, 在所有 Java 提交中击败了96.43%的用户
内存消耗 :37.9 MB, 在所有 Java 提交中击败了5.00%的用户
