Leetcode
2020.04.25 15:57

20. Valid Parentheses

조회 수 98 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Given a string containing just the characters '('')''{''}''[' and ']', determine if the input string is valid.

An input string is valid if:

  1. Open brackets must be closed by the same type of brackets.
  2. Open brackets must be closed in the correct order.

Note that an empty string is also considered valid.

Example 1:

Input: "()"
Output: true

Example 2:

Input: "()[]{}"
Output: true

Example 3:

Input: "(]"
Output: false

Example 4:

Input: "([)]"
Output: false

Example 5:

Input: "{[]}"
Output: true


/*
class Solution {
    public boolean isValid(String s) {
        Map<Character, Integer> hmap = new HashMap<>();
        Map<Character, Character> pairs = new HashMap<>();
        
        pairs.put(')', '(');
        pairs.put('}', '{');
        pairs.put(']', '[');
        
        for(int i=0; i<s.length(); i++){
            Character ch = s.charAt(i);
            
            if(ch == '(' || ch == '{' || ch == '['){
                hmap.put(ch, hmap.getOrDefault(ch,0)+1);
            }else if(ch == ')' || ch == '}' || ch == ']'){
                Character pair = pairs.get(ch);
                
                if(hmap.containsKey(pair) == false){
                    return false;
                }
                
                hmap.put(pair, hmap.get(pair)-1);
                System.out.println(hmap);
                System.out.println("-> "+pair);
                
                if(hmap.get(pair) == 0){
                    hmap.remove(pair);
                }
            }
        }
        
        return hmap.isEmpty();
    }
}
*/
class Solution {
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<>();
        Map<Character, Character> pairs = new HashMap<>();
        
        pairs.put(')', '(');
        pairs.put('}', '{');
        pairs.put(']', '[');
        
        for(int i=0; i<s.length(); i++){
            Character ch = s.charAt(i);
            
            if(ch == '(' || ch == '{' || ch == '['){
                stack.push(ch);
            }else if(ch == ')' || ch == '}' || ch == ']'){
                if(stack.empty()){
                    return false;
                }

                if(stack.peek() == pairs.get(ch)){
                    stack.pop();
                }else{
                    return false;
                }
            }
        }
        
        return stack.isEmpty();
    }
}


class Solution {
    public boolean isValid(String s) {
        Stack<Character> stack = new Stack<>();
        Map<Character, Character> pairs = new HashMap<>();
        
        pairs.put(')', '(');
        pairs.put('}', '{');
        pairs.put(']', '[');
        
        for(int i=0; i<s.length(); i++){
            Character ch = s.charAt(i);
            
            //if(ch == '(' || ch == '{' || ch == '['){
            if(pairs.containsValue(ch)){
                stack.push(ch);
            //}else if(ch == ')' || ch == '}' || ch == ']'){
            }else if(pairs.containsKey(ch)){
                if(stack.empty()){
                    return false;
                }
                
                if(stack.peek() == pairs.get(ch)){
                    stack.pop();
                }else{
                    return false;
                }
            }
        }
        
        return stack.isEmpty();
    }
}

[문제] https://leetcode.com/problems/valid-parentheses/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
74 Leetcode 692. Top K Frequent Words hooni 2020.04.15 87
73 Leetcode 2. Add Two Numbers hooni 2020.04.14 90
72 Leetcode 731. My Calendar II hooni 2020.04.15 94
71 Leetcode 75. Sort Colors hooni 2020.04.14 95
70 Leetcode 347. Top K Frequent Elements hooni 2020.04.14 96
69 Leetcode 430. Flatten a Multilevel Doubly Linked List file hooni 2020.04.06 98
68 Leetcode 23. Merge k Sorted Lists hooni 2020.04.14 98
67 Leetcode 729. My Calendar I hooni 2020.04.15 98
66 Leetcode 253. Meeting Rooms II hooni 2020.04.15 98
» Leetcode 20. Valid Parentheses hooni 2020.04.25 98
64 Leetcode 62. Unique Paths file hooni 2020.04.09 99
63 Leetcode 7. Reverse Integer hooni 2020.04.28 100
62 Leetcode 946. Validate Stack Sequences hooni 2020.04.08 101
61 Leetcode 973. K Closest Points to Origin hooni 2020.04.15 101
60 Leetcode 852. Peak Index in a Mountain Array hooni 2020.04.28 101
59 Leetcode 350. Intersection of Two Arrays II hooni 2020.04.28 102
58 Leetcode 443. String Compression hooni 2020.04.25 103
57 Leetcode 38. Count and Say hooni 2020.04.25 103
56 Leetcode 53. Maximum Subarray hooni 2020.04.28 106
55 Leetcode 3. Longest Substring Without Repeating Characters hooni 2020.04.09 107
Board Pagination Prev 1 2 3 4 Next
/ 4