lintcode-easy-Valid Parentheses

最新推荐文章于 2020-06-28 09:30:33 发布

林尧彬

最新推荐文章于 2020-06-28 09:30:33 发布

阅读量88

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/goblinengineer/p/5260578.html

本文介绍了一种用于验证括号字符串是否有效的算法，通过使用栈数据结构来确保括号的正确闭合顺序。

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 Solution {
    /**
     * @param s A string
     * @return whether the string is a valid parentheses
     */
    public boolean isValidParentheses(String s) {
        // Write your code here
        
        if(s == null || s.length() == 0)
            return true;
        
        Stack<Character> stack = new Stack<Character>();
        
        int length = s.length();
        
        for(int i = 0; i < s.length(); i++){
            char c = s.charAt(i);
            
            if(c == '(' || c == '[' || c == '{'){
                stack.push(c);
            }
            else{
                if(c == ')'){
                    if(stack.isEmpty() || stack.pop() != '(')
                        return false;
                }
                else if(c == ']'){
                    if(stack.isEmpty() || stack.pop() != '[')
                        return false;
                }
                else{
                    if(stack.isEmpty() || stack.pop() != '{')
                        return false;
                }
            }
        }
        
        if(stack.isEmpty())
            return true;
        else    
            return false;
    }
}