-
Notifications
You must be signed in to change notification settings - Fork 29
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
fa8ffee
commit b32b428
Showing
1 changed file
with
33 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,33 @@ | ||
/** | ||
921. Minimum Add to Make Parentheses Valid | ||
Solved | ||
Medium | ||
Topics | ||
Companies | ||
A parentheses string is valid if and only if: | ||
It is the empty string, | ||
It can be written as AB (A concatenated with B), where A and B are valid strings, or | ||
It can be written as (A), where A is a valid string. | ||
You are given a parentheses string s. In one move, you can insert a parenthesis at any position of the string. | ||
For example, if s = "()))", you can insert an opening parenthesis to be "(()))" or a closing parenthesis to be "())))". | ||
Return the minimum number of moves required to make s valid. | ||
**/ | ||
class Solution { | ||
public int minAddToMakeValid(String s) { | ||
int forward =0; | ||
int mismatch=0; | ||
char[] b = s.toCharArray(); | ||
for(char a:b){ | ||
if(a=='(') forward++; | ||
else{ | ||
if(forward>0) forward--; | ||
else mismatch++; | ||
} | ||
} | ||
|
||
return mismatch+forward; | ||
} | ||
} |