算法Valid Parentheses

点击(此处)折叠或打开

1. public static boolean isValid(String s) {
   
2.     HashMap<Character, Character> map = new HashMap<Character, Character>();
   
3.     map.put(\'(\', \')\');
   
4.     map.put(\'[\', \']\');
   
5.     map.put(\'{\', \'}\');
   
6.  
   
7.     Stack<Character> stack = new Stack<Character>();
   
8.  
   
9.     for (int i = 0; i < s.length(); i++) {
   
10.         char curr = s.charAt(i);
    
11.  
    
12.         if (map.keySet().contains(curr)) {
    
13.             stack.push(curr);
    
14.         } else if (map.values().contains(curr)) {
    
15.             if (!stack.empty() && map.get(stack.peek()) == curr) {
    
16.                 stack.pop();
    
17.             } else {
    
18.                 return false;
    
19.             }
    
20.         }
    
21.     }
    
22.  
    
23.     return stack.empty();
    
24. }

来自 “ ITPUB博客 ” ，链接：http://blog.itpub.net/29012686/viewspace-1153230/，如需转载，请注明出处，否则将追究法律责任。

转载于:http://blog.itpub.net/29012686/viewspace-1153230/