We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 09d0b68 commit 4effb35Copy full SHA for 4effb35
2/add_two_numbers.rb
@@ -11,20 +11,20 @@
11
# @param {ListNode} l2
12
# @return {ListNode}
13
def add_two_numbers(l1, l2)
14
- ll_common = ListNode.new(nil)
15
- ll = ll_common
+ ln_result = ListNode.new(nil)
+ ln = ln_result
16
next_is_present = true
17
while next_is_present
18
next_is_present = l1&.next || l2&.next
19
- ll_val = l1&.val.to_i + l2&.val.to_i + ll&.val.to_i
20
- int = ll_val/10
+ ln_val = l1&.val.to_i + l2&.val.to_i + ln&.val.to_i
+ int = ln_val/10
21
22
- ll.val = int > 0 ? ll_val - 10 : ll_val
23
- ll.next = ListNode.new(int) if next_is_present || int > 0
+ ln.val = int > 0 ? ln_val - 10 : ln_val
+ ln.next = ListNode.new(int) if next_is_present || int > 0
24
25
l1 = l1.next if l1
26
l2 = l2.next if l2
27
- ll = ll.next
+ ln = ln.next
28
end
29
- ll_common
+ ln_result
30
0 commit comments