-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAdd_Two_Numbers.c
138 lines (130 loc) · 4.31 KB
/
Add_Two_Numbers.c
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
//16ms beats 100%
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
#define TRUE 1
#define FALSE 0
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
struct ListNode* l1Current = l1;
struct ListNode* l2Current = l2;
struct ListNode* l1Prev = l1;
struct ListNode* l2Prev = l2;
struct ListNode* lAns;
bool fgIsLastNodeBiggerThan10 = FALSE;
int l1Val = 0;
int l2Val = 0;
int l1Valplusl2Val;
bool fgIsUsel1AsAnswer = TRUE;
bool fgIsReturnDebug = FALSE;
if(l1->val ==9 && l2->val ==1 ){
if(l1->next){
if( l1->next->val == 8)
fgIsReturnDebug = TRUE;
}
}
while (l1Current != NULL && l2Current != NULL){
l1Valplusl2Val = l1Current->val + l2Current->val+ + fgIsLastNodeBiggerThan10;
if(l1Valplusl2Val > 9 ){
l1Valplusl2Val = l1Valplusl2Val - 10;
fgIsLastNodeBiggerThan10 = TRUE;
}
else
fgIsLastNodeBiggerThan10 = FALSE;
l1Current->val = l1Valplusl2Val;
l2Current->val = l1Valplusl2Val;
if(l1Current->next == NULL && l2Current->next != NULL){
fgIsUsel1AsAnswer = FALSE;
break;
}
else if(l2Current->next == NULL && l1Current->next != NULL){
fgIsUsel1AsAnswer = TRUE;
break;
}
else if(l2Current->next == NULL && l1Current->next == NULL){
fgIsUsel1AsAnswer = FALSE;
break;
}
else {
l1Current = l1Current->next;
l2Current = l2Current->next;
}
}
if(fgIsUsel1AsAnswer){
l1Current = l1Current->next;
l1Valplusl2Val = l1Current->val + fgIsLastNodeBiggerThan10;
if(l1Valplusl2Val > 9 ){
l1Valplusl2Val = l1Valplusl2Val - 10;
fgIsLastNodeBiggerThan10 = TRUE;
}
else {
fgIsLastNodeBiggerThan10 = FALSE;
}
l1Current->val = l1Valplusl2Val;
while(l1Current->next != NULL){
l1Current = l1Current->next;
l1Valplusl2Val = l1Current->val + fgIsLastNodeBiggerThan10;
if(l1Valplusl2Val > 9 ){
l1Valplusl2Val = l1Valplusl2Val - 10;
fgIsLastNodeBiggerThan10 = TRUE;
}
else
fgIsLastNodeBiggerThan10 = FALSE;
l1Current->val = l1Valplusl2Val;
}
if(fgIsLastNodeBiggerThan10){
l1Current->next = l2;
l1Current->next->val = fgIsLastNodeBiggerThan10;
l1Current->next->next = NULL;
return l1;
}else
return l1;
}
else {
if(l2Current->next != NULL){
l2Current = l2Current->next;
l1Valplusl2Val = l2Current->val + fgIsLastNodeBiggerThan10;
if(l1Valplusl2Val > 9 ){
l1Valplusl2Val = l1Valplusl2Val - 10;
fgIsLastNodeBiggerThan10 = TRUE;
}
else {
fgIsLastNodeBiggerThan10 = FALSE;
}
l2Current->val = l1Valplusl2Val;
while(l2Current->next != NULL){
l2Current = l2Current->next;
l1Valplusl2Val = l2Current->val + fgIsLastNodeBiggerThan10;
if(l1Valplusl2Val > 9 ){
l1Valplusl2Val = l1Valplusl2Val - 10;
fgIsLastNodeBiggerThan10 = TRUE;
}
else
fgIsLastNodeBiggerThan10 = FALSE;
l2Current->val = l1Valplusl2Val;
}
if(fgIsLastNodeBiggerThan10){
l2Current->next = l1;
l2Current->next->val = fgIsLastNodeBiggerThan10;
l2Current->next->next = NULL;
return l2;
}
else
return l2;
}
else{
if(fgIsLastNodeBiggerThan10){
l2Current->next = l1;
l2Current->next->val = fgIsLastNodeBiggerThan10;
l2Current->next->next = NULL;
return l2;
}
else{
return l2;
}
}
}
}