leetcode20.判断括号是否成对出现

发表于 更新于 分类于 ，

判断括号是否成对出现

判断一个字符串中的括号是否成对出现
该题的核心思路在于使用栈。

该方法虽然不是最优解 但是思路还是比较清晰的

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
/**
 * @author rale
 * 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 class Solution1 {
    public boolean isValid(String s) {
        char[] list = s.toCharArray();
        Stack<Character> stack = new Stack<Character>();
        for(char temp : list){
            if(temp=='(' || temp=='[' || temp=='{'){
                stack.push(temp);
            }
            if(temp=='}' && (stack.isEmpty()||stack.pop()!='{')){
                return false;
            }
            if(temp==')' && (stack.isEmpty()||stack.pop()!='(')){
                return false;
            }
            if(temp==']'&& (stack.isEmpty()||stack.pop()!='[')){
                return false;
            }
        }
        if(!stack.isEmpty()){
            return false;
        }
        return true;
    }
}