-
Notifications
You must be signed in to change notification settings - Fork 19
/
validParentheses.java
34 lines (30 loc) · 1.18 KB
/
validParentheses.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
import java.util.Stack;
/**
* Created by codingBoy on 17/2/5.
*/
public class validParentheses
{
/**
* Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
* The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.
* 给定一个字符串,只包含字符“(',”),“{”,“}”,“,”和“,”,确定输入字符串是否有效。括号必须以正确的顺序关闭,“()”和“(”){“都是有效的,但”(“)”和“([ ] ] ]”不是。
*/
public static void main(String[] args)
{
System.out.println(isValid("({})[]"));
}
public static boolean isValid(String s) {
Stack<Character> stack = new Stack<Character>();
for (char c : s.toCharArray()) {
if (c == '(')
stack.push(')');
else if (c == '{')
stack.push('}');
else if (c == '[')
stack.push(']');
else if (stack.isEmpty() || stack.pop() != c)
return false;
}
return stack.isEmpty();
}
}