물음표 살인마의 개발블로그

알고리즘 문제/Leetcode

Valid Parentheses

BEstyle 2022. 9. 28. 21:20

Given a string s 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.
  3. Every close bracket has a corresponding open bracket of the same type.

 

Example 1:

Input: s = "()"
Output: true

Example 2:

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

Example 3:

Input: s = "(]"
Output: false

 

Constraints:

  • 1 <= s.length <= 104
  • s consists of parentheses only '()[]{}'.

class Solution {
    public boolean isValid(String s) {
        int max=s.length()/2;
        if (s.length()%2==1) return false;
        System.out.println(s.length());
        for (int i=0; i<max; i++){
            s=s.replace("[]","");
            s=s.replace("()","");
            s=s.replace("{}","");
        }
        System.out.println(s);
        if (s.equals("")) return true;
        return false;
    }
}

'알고리즘 문제 > Leetcode' 카테고리의 다른 글

Fizz Buzz  (0) 2022.10.06
Best Time to Buy and Sell Stock  (0) 2022.10.04
Longest Common Prefix  (0) 2022.09.28
Palindrome Number  (0) 2022.09.28
Two Sum  (0) 2022.09.27