-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAddTwoNumbers.java
46 lines (34 loc) · 1.07 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
/**
* 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; }
* }
*/
//Space: O(1)
//Time: O(max(len(l1), len(l2))
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode sol = dummy;
int carry = 0;
while(l1 != null || l2 != null) {
int curr = 0;
if (l1 != null) curr += l1.val;
if (l2 != null) curr += l2.val;
curr += carry;
sol.next = new ListNode(curr % 10);
carry = curr / 10;
sol = sol.next;
if (l1 != null) l1 = l1.next;
if (l2 != null) l2 = l2.next;
}
if (carry > 0) {
sol.next = new ListNode(carry);
}
return dummy.next;
}
}