首页 > 其他 > 详细

20. Valid Parentheses

时间:2017-07-14 12:26:58      阅读:203      评论:0      收藏:0      [点我收藏+]

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.


括号匹配,遍历string,碰到左括号把左括号入栈,碰到右括号出栈,判断出栈的字符和右括号是否匹配。

public class Solution {
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<Character>();
        for (int i = 0; i < s.length(); i++) {
            switch (s.charAt(i)) {
                case ‘(‘:
                case ‘{‘:
                case ‘[‘:
                    stack.push(s.charAt(i));
                    break;
                case ‘)‘:
                    if (stack.empty() || stack.pop() != ‘(‘) {
                        return false;
                    }
                    break;
                case ‘}‘:
                    if (stack.empty() || stack.pop() != ‘{‘) {
                        return false;
                    }
                    break;
                case ‘]‘:
                    if (stack.empty() || stack.pop() != ‘[‘) {
                        return false;
                    }
                    break;
            }
        }
        if (stack.empty()) {
            return true;
        } else {
            return false;
        }
    }
}

 

20. Valid Parentheses

原文:http://www.cnblogs.com/yuchenkit/p/7169505.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!