-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvalid_parentheses.rs
42 lines (40 loc) · 1007 Bytes
/
valid_parentheses.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
///
/// Problem: Valid Parentheses
///
/// Given a string `s` containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
///
/// A 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.
///
/// Example 1:
/// Input: s = "()"
/// Output: true
///
/// Example 2:
/// Input: s = "()[]{}"
/// Output: true
///
/// Example 3:
/// Input: s = "(]"
/// Output: false
///
/// # Solution:
///
/// Time complexity: O(1)
/// Space complexity: O(n)
impl Solution {
pub fn is_valid(s: String) -> bool {
let mut stack = Vec::new();
for i in s.chars() {
match i {
'{' => stack.push('}'),
'(' => stack.push(')'),
'[' => stack.push(']'),
'}'|')'|']' if Some(i) != stack.pop() => return false,
_ => (),
}
}
return stack.is_empty();
}
}