Skip to content

Commit 1385adc

Browse files
authored
Merge pull request #710 from fartem/129_Sum_Root_to_Leaf_Numbers
2024-08-15 v. 6.4.8: added "129. Sum Root to Leaf Numbers"
2 parents 24e3e29 + b4a82ed commit 1385adc

File tree

4 files changed

+60
-1
lines changed

4 files changed

+60
-1
lines changed

README.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -513,3 +513,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
513513
| 117. Populating Next Right Pointers in Each Node II | [Link](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | [Link](./lib/medium/117_populating_next_right_pointers_in_each_node_ii.rb) |
514514
| 120. Triangle | [Link](https://leetcode.com/problems/triangle/) | [Link](./lib/medium/120_triangle.rb) |
515515
| 128. Longest Consecutive Sequence | [Link](https://leetcode.com/problems/longest-consecutive-sequence/) | [Link](./lib/medium/128_longest_consecutive_sequence.rb) |
516+
| 129. Sum Root to Leaf Numbers | [Link](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | [Link](./lib/medium/129_sum_root_to_leaf_numbers.rb) |

leetcode-ruby.gemspec

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ require 'English'
55
::Gem::Specification.new do |s|
66
s.required_ruby_version = '>= 3.0'
77
s.name = 'leetcode-ruby'
8-
s.version = '6.4.7'
8+
s.version = '6.4.8'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
1111
s.executable = 'leetcode-ruby'
Lines changed: 23 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
# frozen_string_literal: true
2+
3+
# https://leetcode.com/problems/sum-root-to-leaf-numbers/
4+
# @param {TreeNode} root
5+
# @return {Integer}
6+
def sum_numbers(root)
7+
sum129(root, 0)
8+
end
9+
10+
private
11+
12+
# @param {TreeNode} node
13+
# @param {Integer} curr
14+
# @return {Integer}
15+
def sum129(node, curr)
16+
return 0 unless node
17+
18+
curr = curr * 10 + node.val
19+
20+
return curr if node.left.nil? && node.right.nil?
21+
22+
sum129(node.left, curr) + sum129(node.right, curr)
23+
end
Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
# frozen_string_literal: true
2+
3+
require_relative '../test_helper'
4+
require_relative '../../lib/common/binary_tree'
5+
require_relative '../../lib/medium/129_sum_root_to_leaf_numbers'
6+
require 'minitest/autorun'
7+
8+
class SumRootToLeafNumbersTest < ::Minitest::Test
9+
def test_default
10+
assert_equal(
11+
25,
12+
sum_numbers(
13+
::TreeNode.new(
14+
1,
15+
::TreeNode.new(2),
16+
::TreeNode.new(3)
17+
)
18+
)
19+
)
20+
assert_equal(
21+
1026,
22+
sum_numbers(
23+
::TreeNode.new(
24+
4,
25+
::TreeNode.new(
26+
9,
27+
::TreeNode.new(5),
28+
::TreeNode.new(1)
29+
),
30+
::TreeNode.new(0)
31+
)
32+
)
33+
)
34+
end
35+
end

0 commit comments

Comments
 (0)