@@ -0,0 +1,428 @@
+%0Apublic class _112PathSum %7B%0A    public boolean hasPathSum(TreeNode root, int sum) %7B%0A        if (root == null) return false;%0A        if (root.val == sum && root.left == null && root.right == null) return true;%0A        else return hasPathSum(root.left, sum - root.val) %7C%7C hasPathSum(root.right, sum - root.val);%0A    %7D%0A    %0A%09public class TreeNode %7B%0A%09%09int val;%0A%09%09TreeNode left;%0A%09%09TreeNode right;%0A%09%09TreeNode(int x) %7B val = x; %7D%0A%09%7D%0A%7D%0A

Add 112 solution