Leetcode#20||Valid Parentheses

最新推荐文章于 2021-07-09 20:22:50 发布

liujunlovecs

最新推荐文章于 2021-07-09 20:22:50 发布

阅读量237

点赞数

本文链接：https://blog.csdn.net/liujunlovecs/article/details/47442595

版权

刷题同时被 3 个专栏收录

199 篇文章 0 订阅

订阅专栏

Leetcode

198 篇文章 0 订阅

订阅专栏

String

25 篇文章 0 订阅

订阅专栏

public class Solution {
    public boolean isValid(String s) {
        Map<Character, Character> map = new HashMap<Character, Character>();
        map.put('(', ')');
        map.put('[', ']');
        map.put('{', '}');
        
        Stack<Character> stack = new Stack<Character>();
        
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            
            if (map.keySet().contains(c)) {
                stack.push(c);
            } else if (map.values().contains(c)) {
                if (!stack.isEmpty() && map.get(stack.peek()) == c) {
                    stack.pop();
                } else {
                    return false;
                }
            }
        }
       
        return stack.isEmpty();     
    }
}