edit 22

fishercoder1534 · fishercoder1534 · commit 7bb9ef17ff6a · 2017-06-14T06:43:07.000-07:00
diff --git a/README.md b/README.md
@@ -499,7 +499,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_25.java)|O(n)|O(1)| Hard | Recursion, LinkedList
 |24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_24.java)|O(n)|O(h)|Medium| Recursion, LinkedList
 |23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_23.java)|O(n*logk)|O(logk)|Hard|Heap
-|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/GenerateParentheses.java)|TBD|O(n)|Medium|Backtracking
+|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_22.java)|TBD|O(n)|Medium|Backtracking
 |21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_21.java)|O(n)|O(h)|Easy| Recursion
 |20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_20.java)|O(n)|O(n)|Easy|Stack
 |19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_19.java)|O(n)|O(1)|Medium| Linked List
diff --git a/src/main/java/com/fishercoder/solutions/_22.java b/src/main/java/com/fishercoder/solutions/_22.java
@@ -17,7 +17,7 @@
  "()()()"
  ]*/
 
-public class GenerateParentheses {
+public class _22 {
     public List<String> generateParenthesis(int n) {
         List<String> result = new ArrayList();
         backtrack(result, "", 0, 0, n);
@@ -40,7 +40,7 @@ void backtrack(List<String> result, String str, int left, int right, int max){
     }
     
     public static void main(String...args){
-        GenerateParentheses test = new GenerateParentheses();
+        _22 test = new _22();
         int n = 3;
         List<String> result = test.generateParenthesis(n);
         CommonUtils.print(result);
