@@ -0,0 +1,1078 @@
+package leetcode;%0A%0Aimport java.util.ArrayList;%0Aimport java.util.List;%0A%0Apublic class Problem113 %7B%0A    public static class TreeNode %7B%0A        int val;%0A        TreeNode left;%0A        TreeNode right;%0A%0A        TreeNode(int x) %7B%0A            val = x;%0A        %7D%0A    %7D%0A%0A    public List%3CList%3CInteger%3E%3E pathSum(TreeNode root, int sum) %7B%0A        List%3CList%3CInteger%3E%3E paths = new ArrayList%3C%3E();%0A        return paths;%0A    %7D%0A    %0A    public static void main(String%5B%5D args) %7B%0A        Problem113 prob = new Problem113();%0A        %0A        TreeNode root = new TreeNode(5);%0A        root.left = new TreeNode(4);%0A        root.left.left = new TreeNode(11);%0A        root.left.left.left = new TreeNode(7);%0A        root.left.left.right = new TreeNode(2);%0A        root.right = new TreeNode(8);%0A        root.right.left = new TreeNode(13);%0A        root.right.right = new TreeNode(4);%0A        root.right.right.left = new TreeNode(5);%0A        root.right.right.right = new TreeNode(1);%0A        %0A        for (List%3CInteger%3E path : prob.pathSum(root, 22)) %7B%0A            System.out.println(path);%0A        %7D%0A    %7D%0A%7D%0A

Create a skeleton for problem 113