8. String to Integer (atoi)
Implement the myAtoi(string s)
function, which converts a string to a 32-bit signed integer (similar to C/C++'s atoi
function).
The algorithm for myAtoi(string s)
is as follows:
- Read in and ignore any leading whitespace.
- Check if the next character (if not already at the end of the string) is
'-'
or'+'
. Read this character in if it is either. This determines if the final result is negative or positive respectively. Assume the result is positive if neither is present. - Read in next the characters until the next non-digit character or the end of the input is reached. The rest of the string is ignored.
- Convert these digits into an integer (i.e.
"123" -> 123
,"0032" -> 32
). If no digits were read, then the integer is0
. Change the sign as necessary (from step 2). - If the integer is out of the 32-bit signed integer range
[-231, 231 - 1]
, then clamp the integer so that it remains in the range. Specifically, integers less than-231
should be clamped to-231
, and integers greater than231 - 1
should be clamped to231 - 1
. - Return the integer as the final result.
Note:
- Only the space character
' '
is considered a whitespace character. - Do not ignore any characters other than the leading whitespace or the rest of the string after the digits.
Example 1:
Input: s = "42"
Output: 42
Explanation: The underlined characters are what is read in, the caret is the current reader position.
Step 1: "42" (no characters read because there is no leading whitespace)
^
Step 2: "42" (no characters read because there is neither a '-' nor '+')
^
Step 3: "42" ("42" is read in)
^
The parsed integer is 42.
Since 42 is in the range [-231, 231 - 1], the final result is 42.
Example 2:
Input: s = " -42"
Output: -42
Explanation:
Step 1: " -42" (leading whitespace is read and ignored)
^
Step 2: " -42" ('-' is read, so the result should be negative)
^
Step 3: " -42" ("42" is read in)
^
The parsed integer is -42.
Since -42 is in the range [-231, 231 - 1], the final result is -42.
Example 3:
Input: s = "4193 with words"
Output: 4193
Explanation:
Step 1: "4193 with words" (no characters read because there is no leading whitespace)
^
Step 2: "4193 with words" (no characters read because there is neither a '-' nor '+')
^
Step 3: "4193 with words" ("4193" is read in; reading stops because the next character is a non-digit)
^
The parsed integer is 4193.
Since 4193 is in the range [-231, 231 - 1], the final result is 4193.
class Solution {
public int myAtoi(String s) {
// case 0
if (s == null || s.length() == 0){
return 0;
}
// case 1
int i = 0;
int len = s.length();
while(i < len && s.charAt(i) == ' '){
i++;
}
// case 2
boolean positive = true;
if (i < len && (s.charAt(i) == '+' || s.charAt(i) == '-')){
positive = (s.charAt(i) == '+');
i++;
}
long sum = 0;
while(i < len && s.charAt(i) >= '0' && s.charAt(i) <= '9'){
sum = sum * 10 + s.charAt(i) - '0'; // case 4
if (positive == true && sum > (long) Integer.MAX_VALUE){ // case 5
return Integer.MAX_VALUE;
}
if (positive == false && (-sum) < (long) Integer.MIN_VALUE){
// case 5
return Integer.MIN_VALUE;
}
i++;
}
if (positive == true){
return (int) sum;
}else{
return (int) (-sum);
}
}
}
/*
0. s == null || s.length()==0 => return 0
1. ignore any leading whitespace: " 1234" -> 1234
2. positive: "+1234" ->1234 "-1231" -> -1231
3. number s.length()
3.1 number: charAt(i) >= '0' <='9'
3.2 i < s.length();
4. 0032. -> sum = sum *10 + charAt(i) - '0'; -> 32
5. long -> >= Integer.MAX_VALUE ->return max
long - -> <= Integer.MIN_VALUE -> min
*/
class Solution {
public int myAtoi(String s) {
boolean isNeg = false;
boolean firstDigit = false;
boolean sign = false;
int cur = 0;
for (int i = 0; i < s.length(); i++){
if (s.charAt(i) == ' '){
if (firstDigit == true || sign == true){
break;
}
continue;
}
if (s.charAt(i) == '+'){
if (firstDigit == true || sign == true){
break;
}
sign = true;
continue;
}
if (s.charAt(i) == '-'){
if (firstDigit == true || sign == true){
break;
}
sign = true;
isNeg = true;
continue;
}
if (Character.isDigit(s.charAt(i)) == false){
break;
}
if (firstDigit == false){
firstDigit = true;
}
if ((Integer.MAX_VALUE - s.charAt(i) + '0')/ 10 < cur){
if (isNeg == true){
return Integer.MIN_VALUE;
}else{
return Integer.MAX_VALUE;
}
}else{
cur = cur * 10 + (s.charAt(i) - '0');
}
}
if (isNeg == true){
cur = -cur;
}
return cur;
}
}
// TC: O(n)
// SC: O(1)
https://www.youtube.com/watch?v=zwZXiutgrUE