update

Author: dunso

Scala/Tree/LeetCode0113.scala

@@ -1,4 +1,3 @@
-package com.leetcode.tree
 
 class TreeNode(var _value: Int) {
   var value: Int = _value
@@ -8,18 +7,18 @@ class TreeNode(var _value: Int) {
 
 object LeetCode0113 {
   def pathSum(root: TreeNode, sum: Int): List[List[Int]] = {
-    if (root == null || sum == 0) {
 
-    }
     if (root == null) return List();
+    if (root != null && root.left == null && root.right == null &&  sum == root.value) {
+      return List(List(sum));
+    }
     var path: List[List[Int]] = List();
-    if (root.left != null && sum > root.value) {
+    if (root.left != null && sum != root.value) {
       path :::= pathSum(root.left, sum - root.value).map(root.value :: _);
     }
-    if (root.right != null && sum > root.value) {
+    if (root.right != null && sum != root.value) {
       path :::= pathSum(root.right, sum - root.value).map(root.value :: _);
     }
     path;
   }
 }
-