forked from Raushan-Kumar-Sinha/hactoberfest2022-4
-
Notifications
You must be signed in to change notification settings - Fork 0
/
AddTwoNumbers.java
66 lines (64 loc) · 1.62 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
/**
* 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 {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode ans = new ListNode(0);
ListNode curr = ans;
int carry = 0,sum=0;
while(l1!=null && l2!=null){
sum = l1.val+l2.val+carry;
if(sum>9){
carry = sum/10;
sum = sum%10;
} else{
carry = 0;
}
curr.next = new ListNode(sum);
curr = curr.next;
l1=l1.next;
l2=l2.next;
sum=0;
}
if(l1!=null){
while(l1!=null){
sum = l1.val+carry;
if(sum>9){
carry = sum/10;
sum = sum%10;
}else{
carry=0;
}
curr.next = new ListNode(sum);
curr = curr.next;
l1=l1.next;
sum=0;
}
}
if(l2!=null){
while(l2!=null){
sum = l2.val+carry;
if(sum>9){
carry = sum/10;
sum = sum%10;
} else{
carry=0;
}
curr.next = new ListNode(sum);
curr = curr.next;
l2=l2.next;
sum=0;
}
}
if(carry!=0)
curr.next = new ListNode(carry);
return ans.next;
}
}