-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2. Add Two Numbers.java
53 lines (42 loc) · 1.45 KB
/
2. Add Two Numbers.java
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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int prev_reminder = 0; // This variable carry the reminder number from previous node
ListNode rev_out = null;
while (l1 != null || l2 != null || prev_reminder != 0) {
// Decide digit from linked lists
int digit_l1 = (l1 != null) ? l1.val : 0,
digit_l2 = (l2 != null) ? l2.val : 0;
// Sum digits and previous reminder
int sum = digit_l1 + digit_l2 + prev_reminder;
// Update prev_reminder
prev_reminder = sum / 10;
// Append new node
ListNode new_node = new ListNode(sum % 10);
new_node.next = null;
if (rev_out == null) {
rev_out = new_node;
}
else {
ListNode curr_node = rev_out;
while (curr_node.next != null) {
curr_node = curr_node.next;
}
curr_node.next = new_node;
}
// Update l1 & l2
l1 = (l1 != null) ? l1.next : null;
l2 = (l2 != null) ? l2.next : null;
}
return rev_out;
}
}