-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsum-root-to-leaf-numbers.php
98 lines (78 loc) · 2.01 KB
/
sum-root-to-leaf-numbers.php
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
<!DOCTYPE html>
<html>
<body>
<?php
/*
Problem: https://leetcode.com/problems/sum-root-to-leaf-numbers/
Lesson learned:
-
-
*/
$solution = new Solution();
$result;
/**
* Definition for a binary tree node.
* class TreeNode {
* public $val = null;
* public $left = null;
* public $right = null;
* function __construct($val = 0, $left = null, $right = null) {
* $this->val = $val;
* $this->left = $left;
* $this->right = $right;
* }
* }
*/
class Solution {
/**
* @param TreeNode $root
* @return Integer
*
* Runtime 0ms beats 100%, Memory 10.97mb beats 41.18%
*/
function sumNumbers($root) {
if(($root->left === null) && ($root->right === null)){
return $root->val;
}
$result = array();
if ($root->left !== null){
$left = $this->constructNum($root->left);
foreach($left as $num){
$result[] = strval($root->val) . $num;
}
}
if ($root->right !== null){
$right = $this->constructNum($root->right);
foreach($right as $num){
$result[] = strval($root->val) . $num;
}
}
$resultNum = 0;
foreach($result as $num){
$resultNum += intval($num);
}
return $resultNum;
}
function constructNum(&$root){
if(($root->left === null) && ($root->right === null)){
return array(strval($root->val));
}
$result = array();
if ($root->left !== null){
$left = $this->constructNum($root->left);
foreach($left as $num){
$result[] = strval($root->val) . $num;
}
}
if ($root->right !== null){
$right = $this->constructNum($root->right);
foreach($right as $num){
$result[] = strval($root->val) . $num;
}
}
return $result;
}
}
?>
</body>
</html>