|
11 | 11 | # @param {ListNode} l2 |
12 | 12 | # @return {ListNode} |
13 | 13 | def add_two_numbers(l1, l2) |
14 | | - ll_common = ListNode.new(nil) |
15 | | - ll = ll_common |
| 14 | + ln_result = ListNode.new(nil) |
| 15 | + ln = ln_result |
16 | 16 | next_is_present = true |
17 | 17 | while next_is_present |
18 | 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 |
| 19 | + ln_val = l1&.val.to_i + l2&.val.to_i + ln&.val.to_i |
| 20 | + int = ln_val/10 |
21 | 21 |
|
22 | | - ll.val = int > 0 ? ll_val - 10 : ll_val |
23 | | - ll.next = ListNode.new(int) if next_is_present || int > 0 |
| 22 | + ln.val = int > 0 ? ln_val - 10 : ln_val |
| 23 | + ln.next = ListNode.new(int) if next_is_present || int > 0 |
24 | 24 |
|
25 | 25 | l1 = l1.next if l1 |
26 | 26 | l2 = l2.next if l2 |
27 | | - ll = ll.next |
| 27 | + ln = ln.next |
28 | 28 | end |
29 | | - ll_common |
| 29 | + ln_result |
30 | 30 | end |
0 commit comments