Balanced or Not

CountingStackString

Given a string consisting only of parentheses ( and ), determine if the string is balanced. A string is balanced if every opening parenthesis ( has a corresponding closing parenthesis ) and the pairs are properly nested.

Example 1

Input

[
  "(())"
]

Output

true

Explanation. The string has equal number of opening and closing parentheses and they are properly nested.

Example 2

Input

[
  "(()"
]

Output

false

Explanation. There is an unmatched opening parenthesis.

Example 3

Input

[
  "())"
]

Output

false

Explanation. There is an unmatched closing parenthesis.

Example 4

Input

[
  "((()))"
]

Output

true

Explanation. All parentheses are matched and properly nested.

Example 5

Input

[
  ")("
]

Output

false

Explanation. The parentheses close before they open.

Example 6

Input

[
  "()()()"
]

Output

true

Explanation. All opening parentheses have a corresponding closing parenthesis.

Follow-up: Can you extend this solution to handle other types of brackets such as `{}`, `[]`?

Constraints:

The input string will only contain the characters `(` and `)`. The length of the string will be at most 100 characters.

Views: 2