zoukankan      html  css  js  c++  java
  • Leetcode-Valid Parentheses

    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.

    Solution:

     1 public class Solution {
     2     public boolean isValid(String s) {
     3         Stack<Character> stack = new Stack<Character>();
     4 
     5         for (int i=0;i<s.length();i++){
     6             char cur = s.charAt(i);
     7             if (cur=='(' || cur=='[' || cur=='{')
     8                 stack.push(cur);
     9             else {
    10                 if (stack.isEmpty()) return false;
    11                 char pre = stack.pop();
    12                 if (!isMatch(pre,cur)) return false;
    13             }
    14         }
    15 
    16         if (!stack.isEmpty()) return false;
    17         else return true;
    18         
    19     }
    20 
    21     public boolean isMatch(char a, char b){
    22         if ((a=='(' && b==')') || (a=='[' && b==']') || (a=='{'&&b=='}')) 
    23             return true;
    24         else return false;
    25     }
    26 }
  • 相关阅读:
    G
    C
    B
    B
    线段树模板
    网络流模板
    POJ_1631_Bridging_Signals_(动态规划,LIS)
    POJ_1065_Wooden_Sticks_(动态规划,LIS+鸽笼原理)
    BZOJ_1015_星球大战_[JSOI2008]_(并查集)
    POJ_3280_Cheapest_Palindrome_(动态规划)
  • 原文地址:https://www.cnblogs.com/lishiblog/p/4130173.html
Copyright © 2011-2022 走看看