-
Notifications
You must be signed in to change notification settings - Fork 11
/
Copy pathAdd Two Numbers.cpp
62 lines (62 loc) · 1.38 KB
/
Add Two Numbers.cpp
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
ListNode *h=l1,*p1,*p2;
int carry=0;
while (l1&&l2)
{
l1->val=l1->val+l2->val+carry;
carry=l1->val>9;
l1->val%=10;
p1=l1;p2=l2;
l1=l1->next;
l2=l2->next;
}
if (!l1&&!l2&&carry)
{
p1->next=new ListNode(1);
}
if (l1)
{
while (l1)
{
l1->val=l1->val+carry;
carry=l1->val>9;
l1->val%=10;
p1=l1;
l1=l1->next;
}
if (carry)
{
p1->next=new ListNode(1);
}
}
else if (l2)
{
p1->next=l2;
while (l2)
{
l2->val=l2->val+carry;
carry=l2->val>9;
l2->val%=10;
p2=l2;
l2=l2->next;
}
if (carry)
{
p2->next=new ListNode(1);
}
}
return h;
}
};