-
Notifications
You must be signed in to change notification settings - Fork 0
/
Valid Parenthesis String.cpp
103 lines (98 loc) · 2.62 KB
/
Valid Parenthesis String.cpp
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
/*
Valid Parenthesis String
Solution
Given a string containing only three types of characters: '(', ')' and '*', write a function to check whether this string is valid. We define the validity of a string by these rules:
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.
An empty string is also valid.
Example 1:
Input: "()"
Output: True
Example 2:
Input: "(*)"
Output: True
Example 3:
Input: "(*))"
Output: True
Note:
The string size will be in the range [1, 100].
*/
class Solution {
public:
bool checkValidString(string s) {
map<char,int> c;
vector<char> v;
for(char x: s)
{
if(x == '(')
{
c[x] = c[x] + 1;
v.push_back(x);
}
else if(x == '*')
{
c[x] = c[x] + 1;
v.push_back(x);
}else
{
if(c['('] >0)
{
c['('] = c['('] - 1;
long long q = v.size()-1;
while(v[q] == '*')
{
q--;
}
v.erase(v.begin()+q);
}
else if(c['*'] > 0)
{
c['*'] = c['*'] - 1;
long long q = v.size()-1;
while(v[q] == '(')
{
q--;
}
v.erase(v.begin()+q);
}else
{
return 0;
}
}
}
int fud=0;
int res = 1;
// for(char x:v)
// {
// cout<<" "<<x;
// }
if(c['(']!=0)
{
res = 0;
for(int i=v.size()-1;i>=0;i--)
{
if(v[i] == '*')
{
fud = fud + 1;
}else if(v[i] == '(')
{
c['('] = c['('] -1;
fud = fud -1;
if(fud < 0)
{
// cout<<"break"<<endl;
break;
}
}
if(c['('] == 0)
{
res = 1;
break;
}
}
}
return res;
}
};