-
Notifications
You must be signed in to change notification settings - Fork 0
/
Add two number.cpp
83 lines (68 loc) · 1.88 KB
/
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
/**
* 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 *l1_p = l1;
ListNode *l2_p = l2;
ListNode *result = NULL;
ListNode *rear = NULL;//rear for the result list
ListNode *p = NULL;
int val =0;
int IsOverTen = 0;
while(l1_p!=NULL&&l2_p!=NULL){
val = l1_p->val+l2_p->val+IsOverTen;
IsOverTen = 0;
if(val>=10){
IsOverTen = 1;
val = val-10;
}
p = new ListNode(val);
if(result == NULL){
result = p;
rear = result;
}else{
rear->next = p;
rear = p;
}
l1_p = l1_p->next;
l2_p = l2_p->next;
}
while(l1_p!=NULL){
val = l1_p->val+IsOverTen;
IsOverTen = 0;
if(val>=10){
IsOverTen = 1;
val = val-10;
}
p = new ListNode(val);
rear->next = p;
rear = p;
l1_p = l1_p->next;
}
while(l2_p!=NULL){
val = l2_p->val+IsOverTen;
IsOverTen = 0;
if(val>=10){
IsOverTen = 1;
val = val-10;
}
p = new ListNode(val);
rear->next = p;
rear = p;
l2_p = l2_p->next;
}
if(IsOverTen==1){
p = new ListNode(1);
rear->next = p;
rear = p;
}
return result;
}
};