-
Notifications
You must be signed in to change notification settings - Fork 40
Expand file tree
/
Copy pathAnswer30.cpp
More file actions
70 lines (68 loc) · 1.75 KB
/
Answer30.cpp
File metadata and controls
70 lines (68 loc) · 1.75 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
65
66
67
68
69
70
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* t1=l1;
ListNode* t2=l2;
int count1=0,count2=0;
while(t1){
count1++;
t1=t1->next;
}
while(t2){
count2++;
t2=t2->next;
}
if(count1>=count2){
ListNode* p=l1;
ListNode* q=l2;
ListNode* temp;
int sum=0,carry=0;
while(p&&q){
sum=(p->val+q->val+carry)%10;
carry=(p->val+q->val+carry)/10;
p->val=sum;
temp=p;
p=p->next;
q=q->next;
}
while(p){
sum=(p->val+carry)%10;
carry=(p->val+carry)/10;
p->val=sum;
temp=p;
p=p->next;
}
if(carry){
temp->next=new ListNode(carry);
temp=temp->next;
}
return l1;
}
else{
ListNode* p=l1;
ListNode* q=l2;
ListNode* temp;
int sum=0,carry=0;
while(p&&q){
sum=(p->val+q->val+carry)%10;
carry=(p->val+q->val+carry)/10;
q->val=sum;
temp=q;
p=p->next;
q=q->next;
}
while(q){
sum=(q->val+carry)%10;
carry=(q->val+carry)/10;
q->val=sum;
temp=q;
q=q->next;
}
if(carry){
temp->next =new ListNode(carry);
temp=temp->next;
}
return l2;
}
}
};