edit 113

Author: fishercoder1534

README.md

@@ -442,6 +442,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_116.java)| O(n)|O(1) | Medium| BFS
 |115|[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/DistinctSubsequences.java)| O(m*n)|O(m*n) | Hard| DP
 |114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_114.java)| O(n)|O(h) | Medium| Tree
+|113|[Path Sum II](https://leetcode.com/problems/path-sum-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_113.java)| O(n)|O(h) | Medium| DFS
 |112|[Path Sum](https://leetcode.com/problems/path-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_112.java)| O(n)|O(1) | Easy| DFS
 |111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinimumDepthofBinaryTree.java)| O(n)|O(1)~O(h) | Easy| BFS, DFS
 |110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_110.java)| O(n)|O(1)~O(h) | Easy| DFS

src/main/java/com/fishercoder/solutions/PathSumII.java renamed to src/main/java/com/fishercoder/solutions/_113.java

@@ -24,7 +24,7 @@
    [5,8,4,5]
 ]
 */
-public class PathSumII {
+public class _113 {
     //also, it's possible that a node's value could be negative, as long as the sum of root to leaf ends up to sum
     public List<List<Integer>> pathSum(TreeNode root, int sum) {
         List<List<Integer>> allPaths = new ArrayList();
@@ -54,7 +54,7 @@ private void dfs(TreeNode root, List<Integer> path, List<List<Integer>> allPaths
 
 
     public static void main(String...strings){
-        PathSumII test = new PathSumII();
+        _113 test = new _113();
 //        TreeNode root = new TreeNode(1);
 //        root.left = new TreeNode(2);
 //        int sum = 1;