-
Notifications
You must be signed in to change notification settings - Fork 277
/
AddTwoNumbers.java
64 lines (56 loc) · 1.58 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
/**
* 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 {
// TC : O(Max(length of l1, length of l2))
// SC : O(Max(length of l1, length of l2))
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1 == null){
return l2;
}
if(l2 == null){
return l1;
}
ListNode dummy = new ListNode(-1);
ListNode it = dummy;
int carry = 0;
int sum = 0;
while(l1!=null && l2!=null){
sum = l1.val+l2.val + carry;
ListNode newNode = new ListNode(sum%10);
carry = sum/10;
it.next = newNode;
it = it.next;
l1=l1.next;
l2 =l2.next;
}
while(l1!=null){
sum = l1.val+ carry;
ListNode newNode = new ListNode(sum%10);
carry = sum/10;
it.next = newNode;
it = it.next;
l1=l1.next;
}
while(l2!=null){
sum = l2.val + carry;
ListNode newNode = new ListNode(sum%10);
carry = sum/10;
it.next = newNode;
it = it.next;
l2 =l2.next;
}
if(carry==1){
ListNode newNode = new ListNode(1);
it.next = newNode;
}
return dummy.next;
}
}