update: 1 solution(22)

Author: hijiangtao

README.md

@@ -10,6 +10,7 @@ Progress: 18/
 |2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [JavaScript](./src/add-two-numbers/res.js)|Medium|
 |7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [JavaScript](./src/reverse-integer/res.js)|Easy|
 |13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/) | [JavaScript](./src/roman-to-integer/res.js)|Easy|
+|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [JavaScript](./src/generate-parentheses/res.js)|Medium|
 |66|[Plus One](https://leetcode.com/problems/plus-one/) | [JavaScript](./src/plus-one/res.js)|Easy|
 |69|[Sqrt(x)](https://leetcode.com/problems/sqrtx/) | [JavaScript](./src/sqrtx/res.js)|Easy|
 |175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables/)| [SQL](./src/combine-two-tables/res.txt)|Easy|

src/generate-parentheses/res.js

@@ -0,0 +1,32 @@
+/**
+ * res.js
+ * @authors Joe Jiang (hijiangtao@gmail.com)
+ * @date    2017-02-22 20:15:53
+ * @version $Id$
+ */
+
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+let generateParenthesis = function(n) {
+    let res = [], p = '';
+   	
+    function subProblem(p, left, right) {
+    	if (left) {
+    		subProblem(p+'(', left-1, right);
+    	}
+    	if (right>left) {
+    		subProblem(p+')', left, right-1);
+    	}
+    	if (!right) {
+    		res.push(p);
+    	}
+
+    	return ;
+    }
+
+    subProblem('', n, n);
+
+    return res;
+};