-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2.add_two_number.cpp
63 lines (58 loc) · 1.48 KB
/
2.add_two_number.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
63
//coding:utf-8
/*
Program: add two number
Description:
Shanbo Cheng: [email protected]
Date: 2016-07-06 18:42:55
Last modified: 2016-07-06 19:01:30
GCC version: 4.7.3
*/
#include <iostream>
using namespace std;
struct ListNode {
int val;
ListNode* next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* prev = new ListNode(0);
ListNode* ret = new ListNode(0);
prev->next = ret;
int last = 0, temp = 0;
while(l1 && l2) {
temp = l1->val + l2->val + last;
last = temp / 10;
temp = temp % 10;
ListNode* node = new ListNode(temp);
ret->next = node;
ret = ret->next;
l1 = l1->next;
l2 = l2->next;
}
while(l1) {
temp = l1->val + last;
last = temp / 10;
temp = temp % 10;
ListNode* node = new ListNode(temp);
ret->next = node;
ret = ret->next;
l1 = l1->next;
}
while(l2) {
temp = l2->val + last;
last = temp / 10;
temp = temp % 10;
ListNode* node = new ListNode(temp);
ret->next = node;
ret = ret->next;
l2 = l2->next;
}
if (last) {
ListNode* node = new ListNode(last);
ret->next = node;
}
return prev->next->next;
}
};