forked from DengWangBao/Leetcode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumber.java
More file actions
47 lines (37 loc) · 1.38 KB
/
AddTwoNumber.java
File metadata and controls
47 lines (37 loc) · 1.38 KB
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
public class AddTwoNumber {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0), cur = dummy;
for (int carry = 0; l1 != null || l2 != null || carry > 0; ) {
int n1 = l1 != null ? l1.val : 0;
l1 = l1 != null ? l1.next : null;
int n2 = l2 != null ? l2.val : 0;
l2 = l2 != null ? l2.next : null;
int sum = n1 + n2 + carry;
ListNode node = new ListNode(sum % 10);
carry = sum / 10;
cur.next = node;
cur = node;
}
return dummy.next;
}
// modify source list value
public ListNode addTwoNumbers2(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0), cur = dummy;
for (int carry = 0; l1 != null || l2 != null || carry > 0; ) {
int n1 = l1 != null ? l1.val : 0;
int n2 = l2 != null ? l2.val : 0;
int sum = n1 + n2 + carry;
ListNode node = l1 != null ? l1 : l2 != null ? l2 : new ListNode(0);
node.val = sum % 10;
carry = sum / 10;
cur.next = node;
cur = node;
if ((l1 == null || l2 == null) && carry == 0) {
break;
}
l1 = l1 != null ? l1.next : null;
l2 = l2 != null ? l2.next : null;
}
return dummy.next;
}
}