-
Notifications
You must be signed in to change notification settings - Fork 0
/
LeetCode1006.java
72 lines (70 loc) · 1.95 KB
/
LeetCode1006.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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
import com.sun.xml.internal.ws.api.model.wsdl.WSDLOutput;
import java.util.Stack;
/**
* @ProjectName: LeetCode
* @Author: XinyuLiu
* @Description:
*/
public class LeetCode1006 {
//1.垃圾法
/*public static int clumsy(int N) {
Stack<Integer> stack = new Stack<>();
char[] sign = new char[]{'*','/','+','-'};
stack.push(N--);
int i = 0;
boolean flag = false;
while(N!=0){
if(sign[i%4]=='*'){
stack.push((stack.pop() * N--));
}else if(sign[i%4]=='/'){
stack.push((stack.pop() / N--));
}else if(sign[i%4]=='+'){
if(flag){
stack.push(-1);
stack.push(N--);
}else{
flag = true;
stack.push((stack.pop() + N--));
}
}else{
stack.push(-1);
stack.push(N--);
}
i++;
}
while(!stack.isEmpty()){
if(stack.size()==1){
return stack.pop();
}
int a = stack.pop();
stack.pop();
int b = stack.pop();
stack.push(b-a);
}
return 0;
}*/
//2.优化1(栈队列法),-号变成负数存入栈
public static int clumsy(int N) {
Stack<Integer> stack = new Stack<>();
char[] sign = new char[]{'*','/','+','-'};
stack.push(N--);
int i = 0;
while(N!=0){
if(sign[i%4]=='*'){
stack.push((stack.pop() * N--));
}else if(sign[i%4]=='/'){
stack.push((stack.pop() / N--));
}else if(sign[i%4]=='+'){
stack.push((stack.pop() + N--));
}else{
stack.push(-N--);
}
i++;
}
int result =0;
while(!stack.isEmpty()){
result+=stack.pop();
}
return result;
}
}