-
Notifications
You must be signed in to change notification settings - Fork 4.9k
Expand file tree
/
Copy pathAdd Two Numbers.java
More file actions
64 lines (58 loc) · 1.5 KB
/
Add Two Numbers.java
File metadata and controls
64 lines (58 loc) · 1.5 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
//Difficulty-Medium
/**
* 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) {
int carry=0,sum=0,add=0;
ListNode head=new ListNode();
ListNode n=new ListNode(0,head);
while(l1!=null || l2!=null){
ListNode l3=new ListNode();
if(l1!=null && l2!=null){
add=l1.val+l2.val;
l1=l1.next;
l2=l2.next;
}
else if(l1!=null){
add=l1.val;
l1=l1.next;
}
else{
add=l2.val;
l2=l2.next;
}
sum=(add+carry)%10;
carry=(add+carry)/10;
if(head==null){
head.val=sum;
head.next=null;
}
else{
// n=head;
while(n.next!=null){
n=n.next;
}
l3.val=sum;
l3.next=null;
n.next=l3;
}
}
if(carry==1){
ListNode node=new ListNode();
node.val=carry;
node.next=null;
while(n.next!=null)
n=n.next;
n.next=node;
}
return head.next;
}
}