-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumbers.cpp
More file actions
60 lines (53 loc) · 1.49 KB
/
AddTwoNumbers.cpp
File metadata and controls
60 lines (53 loc) · 1.49 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
/**
You are given two linked lists representing two non-negative numbers.
The digits are stored in reverse order and each of their nodes contain a single digit.
Add the two numbers and return it as a linked list.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
*/
/**
* 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) {
ListNode dummy(0);
ListNode* head = &dummy;
ListNode* res = head;
ListNode* p1 = l1;
ListNode* p2 = l2;
int carry = 0;
while (l1 && l2) {
int sum = l1->val + l2->val + carry;
res->next = new ListNode(sum%10);
carry = sum/10;
l1 = l1->next;
l2 = l2->next;
res = res->next;
}
while (l1) {
int sum = l1->val + carry;
res->next = new ListNode(sum%10);
carry = sum /10;
res = res->next;
l1 =l1->next;
}
while (l2) {
int sum = l2->val + carry;
res->next = new ListNode(sum%10);
carry = sum/10;
res = res->next;
l2 = l2->next;
}
//be careful of carrying
if (carry >0) {
res->next = new ListNode(carry);
}
return head->next;
}
};