Algorithm
LeetCode算法题
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.
Java 程序实现
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
46
class Solution {
public int myAtoi(String str) {
if (str == null || str.length() == 0) {
return 0;
}
char[] input = str.toCharArray();
char[] target = new char[input.length];
int n = 0;
Boolean sign = null;
for (int i = 0; i < input.length; i++) {
if (sign == null) {
if (input[i] == ' ') continue;
if (input[i] == '-') {
sign = false;
continue;
}
if (input[i] == '+') {
sign = true;
continue;
}
if (!this.isNumeric(input[i])) {
break;
} else {
sign = true;
}
} else if (!isNumeric(input[i])){
break;
}
target[n++] = input[i];
}
if (sign == null) return 0;
long r = 0;
for (int i = 0; i < n; i++) {
r = target[i] - '0' + r * 10L;
if (r > Integer.MAX_VALUE) return sign ? Integer.MAX_VALUE : Integer.MIN_VALUE;
}
return sign ? (int) r : (int) -r;
}
private boolean isNumeric(char c) {
if (c >= '0' && c <= '9') {
return true;
}
return false;
}
}
Review
-
Raft算法等价于Paxos算法
-
更容易理解，更好工程实现
-
精简leader选举机制，简化状态机逻辑
Tip
- 把时间花在重要的事情上，而不是花在紧急的事情上
Share
最近简书被查，导致不能新发文章，只能找一篇旧文 毕业十年
