1
class Solution {
2
public int myAtoi(String s) {
3
long n = 0;
4
int i = 0, a = 0;
5
s = s.trim();
6
if (s.length() == 0) return 0;
7
if (s.charAt(i) == '+' || s.charAt(i) == '-') a = 1;
8
while (a < s.length())
9
if (s.charAt(a) == '0') a++;
10
else break;
11
for (i = a; i < a + 11 && i < s.length(); i++) {
12
if (s.charAt(i) >= '0' && s.charAt(i) <= '9') n = n * 10 + (int) (s.charAt(i) - '0');
13
else break;
14
}
15
if (s.charAt(0) == '-') n = -n;
16
if (n > 2147483647) n = 2147483647;
17
if (n < -2147483648) n = -2147483648;
18
return (int) n;
19
}
20
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0