leetcode学习笔记2
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.
import java.lang.Math;
import java.lang.NumberFormatException;
class Solution {
//public static final int max=2147483647;
//public static final int min=-2147483648;
public static int myAtoi(String str) throws NumberFormatException {
int result = 0;
if (str.matches(".*\\d+.*")) {
String[] splits = str.trim().split("[^\\+\\-\\d]");
if (splits[0].matches("\\+?\\d+.*")||splits[0].matches("\\-?\\d+.*")) {
while(!(splits[0].matches("\\+?\\-?\\d+"))) {
splits[0]=splits[0].substring(0, splits[0].length()-1);
}
try {
result = Integer.parseInt(splits[0]);
} catch (NumberFormatException e) {
if (splits[0].contains("-")) {
result = -2147483648;
}else {
result=2147483647;
}
}
}
}
return result;
}
}
import java.lang.Math;
import java.lang.NumberFormatException;
class Solution {
public int myAtoi(String str) {
int index = 0, sign = 1, total = 0;
//1. Empty string
if(str.length() == 0)
return 0;
//2. Remove Spaces
while(str.charAt(index) == ' '){
index ++;
if(index==str.length())
return 0;
}
//3. Handle signs
if(str.charAt(index) == '+' || str.charAt(index) == '-'){
sign = str.charAt(index) == '+' ? 1 : -1;
index ++;
}
//4. Convert number and avoid overflow
while(index < str.length()){
int digit = str.charAt(index) - '0';
if(digit < 0 || digit > 9) break;
//check if total will be overflow after 10 times and add digit
if(Integer.MAX_VALUE/10 < total || Integer.MAX_VALUE/10 == total && Integer.MAX_VALUE %10 < digit)
return sign == 1 ? Integer.MAX_VALUE : Integer.MIN_VALUE;
total = 10 * total + digit;
index ++;
}
return total * sign;
}
}