1221

Author: zzxboy1

README.md

@@ -23,6 +23,7 @@
 |19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [JavaScript](./algorithms/Remove Nth Node From End of List.js)|Easy|
 |20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [JavaScript](./algorithms/Valid Parentheses.js)|Easy|
 |21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [JavaScript](./algorithms/Merge Two Sorted Lists.js)|Easy|
+|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)| [JavaScript](./algorithms/Generate Parentheses.js)|Medium|
 |371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)| [JavaScript](./algorithms/Sum of Two Integers.js)|Easy|
 |372|[Super Pow](https://leetcode.com/problems/super-pow/)| [JavaScript](./algorithms/SuperPow.js)|Medium|
 

algorithms/Generate Parentheses.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+var add=function(left,right,stack,s){
+    if(left===0 && right===0){
+        stack.push(s);
+        return
+    }
+    if(left===right){
+        add(left-1,right,stack,s+"(");
+    }
+    else if(left===0){
+        add(left,right-1,stack,s+")");
+    }
+    else{
+      add(left-1,right,stack,s+"(");
+      add(left,right-1,stack,s+")");
+    }
+} 
+
+var generateParenthesis = function(n) {
+    var stack=[];
+    add(n,n,stack,"");
+    return stack;
+};