-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path224.基本计算器.rs
49 lines (48 loc) · 1.43 KB
/
224.基本计算器.rs
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
47
48
49
/*
* @lc app=leetcode.cn id=224 lang=rust
*
* [224] 基本计算器
*/
// @lc code=start
impl Solution {
// 逻辑上和官方解答是一样的,但是会超时
pub fn calculate(s: String) -> i32 {
let mut res = 0;
let mut ops: Vec<i32> = vec![1]; //表示多个用()的多表达式的符号栈
let mut sign = 1; //取值是{+1,-1},表示当前表达式的符号
let mut i: usize = 0;
while i < s.len() {
match s.chars().nth(i).unwrap() {
' ' => {
i += 1;
continue;
}
'+' => {
i += 1;
sign = *ops.last().unwrap();
}
'-' => {
i += 1;
sign = -(*ops.last().unwrap());
}
'(' => {
i += 1;
ops.push(sign);
}
')' => {
i += 1;
let _ = ops.pop();
}
_ => {
let number_str: String =
s.chars().skip(i).take_while(|c| c.is_digit(10)).collect();
i += number_str.len();
let mut delta: i32 = number_str.parse::<i32>().unwrap();
res += sign * delta;
}
}
}
res
}
}
// @lc code=end