LeetCode-921 Minimum Add to Make Parentheses Valid Solution (with Java)

Posted 2020-11-27 sheepcore

1. Description: 

Notes: 

2. Examples: 

3.Solutions:

 1 /**
 2  * Created by sheepcore on 2019-05-07
 3  */
 4 class Solution {
 5     public int minAddToMakeValid(String s) {
 6         Stack<Character> stack = new Stack<Character>();
 7         int addnum = 0;
 8         for(int i = 0; i < s.length(); i++){
 9             char ch = s.charAt(i);
10             switch(ch){
11                 case \'(\': stack.push(ch); break;
12                 case \')\':
13                     if(!stack.isEmpty() && stack.peek() == \'(\')
14                         stack.pop();
15                     else
16                         addnum += 1;
17                     break;
18                 default:
19                     System.out.println("Invalid Parentheses");
20             }
21         }
22         return addnum + stack.size();
23     }
24 }