-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAddTwoNumbers.java
75 lines (71 loc) · 1.94 KB
/
AddTwoNumbers.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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if (l1 == null) {
return l2;
} else if (l2 == null) {
return l1;
}
ListNode result = null;
ListNode prev = null;
ListNode temp = null;
int carry = 0;
int val = 0;
while(l1 != null && l2 != null) {
val = ( l1.val + l2.val + carry ) % 10;
temp = new ListNode(val);
carry = ( l1.val + l2.val + carry ) / 10 ;
temp.next = null;
l1 = l1.next;
l2 = l2.next;
if (result == null) {
result = temp;
prev = result;
} else {
prev.next = temp;
prev = temp;
}
}
while (l1 != null) {
val = ( l1.val + carry ) % 10;
temp = new ListNode(val);
carry = ( l1.val + carry ) / 10 ;
temp.next = null;
l1 = l1.next;
if (result == null) {
result = temp;
prev = result;
} else {
prev.next = temp;
prev = temp;
}
}
while (l2 != null) {
val = ( l2.val + carry ) % 10;
temp = new ListNode(val);
carry = ( l2.val + carry ) / 10 ;
temp.next = null;
l2 = l2.next;
if (result == null) {
result = temp;
prev = result;
} else {
prev.next = temp;
prev = temp;
}
}
if (carry > 0) {
temp = new ListNode(carry);
temp.next = null;
prev.next = temp;
}
return result;
}
}