[LEET-0000] clean up

Author: fishercoder1534

leetcode-algorithms/src/main/java/com/stevesun/solutions/PathSum.java

@@ -22,39 +22,4 @@ public boolean hasPathSum(TreeNode root, int sum) {
         return hasPathSum(root.left, sum - root.val) || hasPathSum(root.right, sum - root.val);
     }
 
-    public static void main(String...strings){
-        PathSum test = new PathSum();
-        TreeNode root = new TreeNode(5);
-        root.left = new TreeNode(4);
-        int sum = 5;
-        
-//        TreeNode root = new TreeNode(1);
-//        root.left = new TreeNode(-2);
-//        root.left.left = new TreeNode(1);
-//        root.left.right = new TreeNode(3);
-//        root.right = new TreeNode(-3);
-//        root.right.left = new TreeNode(-2);
-//        root.left.left.left = new TreeNode(-1);
-//        int sum = 2;
-//         1
-//        / \
-//      -2   -3
-//      / \   / 
-//     1   3 -2 
-//    /      
-//   -1
-//        System.out.println(test.hasPathSum(root, sum));
-        System.out.println(test.hasPathSumAgain(root, sum));
-    }
-    
-
-    public boolean hasPathSumAgain(TreeNode root, int sum) {
-        if(root == null) return false;
-        if(root.left == null && root.right == null){
-            if(sum == root.val) return true;
-            else return false;
-        }
-        return hasPathSum(root.left, sum - root.val) || hasPathSum(root.right, sum - root.val);
-    }
-
 }