-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path0098_P678_Valid_Parenthesis_String.cpp
More file actions
55 lines (50 loc) · 1.39 KB
/
0098_P678_Valid_Parenthesis_String.cpp
File metadata and controls
55 lines (50 loc) · 1.39 KB
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
43
44
45
46
47
48
49
50
51
52
53
54
55
/*
Day: 98
Problem Number: 678 (https://leetcode.com/problems/valid-parenthesis-string)
Date: 07-04-2024
Description:
Given a string s containing only three types of characters: '(', ')' and '*', return true if s is valid.
The following rules define a valid string:
* Any left parenthesis '(' must have a corresponding right parenthesis ')'.
* Any right parenthesis ')' must have a corresponding left parenthesis '('.
* Left parenthesis '(' must go before the corresponding right parenthesis ')'.
* '*' could be treated as a single right parenthesis ')' or a single left parenthesis '(' or an empty string "".
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "(*)"
Output: true
Example 3:
Input: s = "(*))"
Output: true
Constraints:
* 1 <= s.length <= 100
* s[i] is '(', ')' or '*'.
Code: */
class Solution {
public:
bool checkValidString(string s) {
int x = 0, n = s.size();
for (int i = 0; i < n; ++i) {
if (s[i] != ')') {
++x;
} else if (x) {
--x;
} else {
return false;
}
}
x = 0;
for (int i = n - 1; i >= 0; --i) {
if (s[i] != '(') {
++x;
} else if (x) {
--x;
} else {
return false;
}
}
return true;
}
};