Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
45 lines (38 loc) · 1.33 KB

File metadata and controls

45 lines (38 loc) · 1.33 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
package Algorithms.string;
public class Atoi {
public int atoi(String str) {
if (str == null) {
return 0;
}
// remove the spaces in the beginning and the end.
String s = str.trim();
boolean minus = false;
long num = 0;
for (int i = 0; i < s.length(); i++) {
/*
takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value.
*/
if (i == 0 && s.charAt(i) == '+') {
continue;
} else if (i == 0 && s.charAt(i) == '-'){
// get the
minus = true;
continue;
}
int c = s.charAt(i) - '0';
if (c > 9 || c < 0) {
// invalid character.
break;
}
num = num * 10 + c;
}
// If the correct value is out of the range of representable values, INT_MAX (2147483647) or INT_MIN (-2147483648) is // returned.
if (minus) {
num = -num;
num = Math.max(num, Integer.MIN_VALUE);
} else {
num = Math.min(num, Integer.MAX_VALUE);
}
return (int)num;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.