-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathValidParentheses.java
More file actions
71 lines (64 loc) · 1.85 KB
/
ValidParentheses.java
File metadata and controls
71 lines (64 loc) · 1.85 KB
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
package leetcode.array;
import java.util.Stack;
/**
* @ClassName ValidParentheses
* @Description 有效括号 https://leetcode-cn.com/problems/valid-parentheses/
* @Author changxuan
* @Date 2020/8/14 下午9:12
**/
public class ValidParentheses {
private Stack<Character> stack = new Stack<Character>();
public boolean isValid(String s) {
if (s.length() % 2 != 0)
return false;
char[] sArr = s.toCharArray();
int i = 0, j = s.length();
while (i < j){
switch (sArr[i]){
case '(':
case '[':
case '{':
stack.push(sArr[i]);
break;
default:
if (stack.peek().equals(sArr[i]))
stack.pop();
else
return false;
}
}
return true;
}
public boolean isValidPro(String s) {
if (s.length() % 2 != 0)
return false;
char[] sArr = s.toCharArray();
char[] temp = new char[sArr.length];
int j = 0;
for (int i = 0; i < sArr.length; i++){
switch (sArr[i]) {
case '(':
case '[':
case '{':
temp[j] = sArr[i];
j++;
break;
default:
if (j != 0 && judge(temp[j-1], sArr[i]))
j--;
else
return false;
}
}
return j == 0 ? true : false;
}
public boolean judge(char right, char left){
if (right == '(' && left == ')')
return true;
if (right == '[' && left == ']')
return true;
if (right == '{' && left == '}')
return true;
return false;
}
}