-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumbers.java
More file actions
82 lines (63 loc) · 1.74 KB
/
Copy pathAddTwoNumbers.java
File metadata and controls
82 lines (63 loc) · 1.74 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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
package org.example;
import java.util.List;
public class AddTwoNumbers {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
// p l1
// q l2
ListNode p = l1;
ListNode q = l2;
ListNode pre = null;
ListNode head = null;
int carry = 0;
while (p != null && q != null) {
ListNode node = new ListNode();
node.val = (p.val + q.val + carry) % 10 ;
node.next = null;
carry = (p.val + q.val + carry) / 10;
if (head == null) {
head = node;
}
if (pre != null) {
pre.next = node;
pre = node;
} else {
pre = node;
}
p = p.next;
q = q.next;
}
while (p != null) {
ListNode node = new ListNode();
node.val = (p.val + carry) % 10;
node.next = null;
carry = (p.val + carry) / 10;
if (pre != null) {
pre.next = node;
pre = node;
} else {
pre = node;
}
p = p.next;
}
while (q != null) {
ListNode node = new ListNode();
node.val = (q.val + carry) % 10;
node.next = null;
carry = (q.val + carry) / 10;
if (pre != null) {
pre.next = node;
pre = node;
} else {
pre = node;
}
q = q.next;
}
if (carry > 0) {
ListNode node = new ListNode();
node.val = carry;
node.next = null;
pre.next = node;
}
return head;
}
}