题目描述:
给你两个 非空 的链表,表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的,并且每个节点只能存储 一位 数字。
请你将两个数相加,并以相同形式返回一个表示和的链表。
你可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例 1:
输入:l1 = [2,4,3], l2 = [5,6,4]
输出:[7,0,8]
解释:342 + 465 = 807.
示例 2:
输入:l1 = [0], l2 = [0]
输出:[0]
示例 3:
输入:l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
输出:[8,9,9,9,0,0,0,1]
提示:
每个链表中的节点数在范围 [1, 100] 内
0 <= Node.val <= 9
题目数据保证列表表示的数字不含前导零
题解:
解题思路:
一开始想的是把l1,l2的数表示出来,然后两者求和,再通过取余把值重新取出来,但后面发现这个方法不可行,因为最大可以有100个节点,也就意味着这种方法取出来的值可能有100位整数部位,没有可以存放那么大的变量的空间,下面是上述想法的代码:
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
struct ListNode* rec1 = l1;
struct ListNode* rec2 = l2;
struct ListNode* head;
struct ListNode* fwd;
long num1 = rec1->val;
long num2 = rec2->val;
long sum = 0;
int calculate_sum = 0;
char length1 = 1;
char length2 = 1;
char length3 = 1;
rec1 = rec1->next;
rec2 = rec2->next;
while(rec1){
num1 += pow(10,length1) * rec1->val;
rec1 = rec1->next;
length1++;
}
while(rec2){
num2 += pow(10,length2) * rec2->val;
rec2 = rec2->next;
length2++;
}
sum = num1 + num2;
calculate_sum = sum;
while(sum / 10){
length3++;
sum /= 10;
}
if(length3 > length1 && length3 > length2 && length1 >= length2){
struct ListNode* rootp = (struct ListNode*)malloc(sizeof(struct ListNode));
rootp->val = calculate_sum % 10;
calculate_sum /= 10;
rootp->next = l1;
head = rootp;
rootp = rootp->next;
while(rootp){
rootp->val = calculate_sum % 10;
calculate_sum /= 10;
rootp = rootp->next;
}
}
else if(length3 > length1 && length3 > length2 && length1 < length2){
struct ListNode* rootp = (struct ListNode*)malloc(sizeof(struct ListNode));
rootp->val = calculate_sum % 10;
calculate_sum /= 10;
rootp->next = l2;
head = rootp;
rootp = rootp->next;
while(rootp){
rootp->val = calculate_sum % 10;
calculate_sum /= 10;
rootp = rootp->next;
}
}
else {
if(length1 >= length2){
l1->val = calculate_sum % 10;
calculate_sum /= 10;
head = l1;
l1 = l1->next;
while(l1){
l1->val = calculate_sum % 10;
calculate_sum /= 10;
l1 = l1->next;
}
}
else{
l2->val = calculate_sum % 10;
calculate_sum /= 10;
head = l2;
l2 = l2->next;
while(l2){
l2->val = calculate_sum % 10;
calculate_sum /= 10;
l2 = l2->next;
}
}
}
return head;
}
既然行不通,那么换一种思路,将l1,l2的值都存放到数组里面在进行操作:
解题思路:
取三个数组num1,num2和sum分别用来存放l1,l2和相加之后的数
这里采用进位的方法,初始时进位标志为0,从表头开始求和,每次求和要加上进位标志,若和>9,则进位标志为1
并求出l1,l2和sum的节点数若sum节点数最大则需要新开一个节点head,并使它的值=sum[0],是它的指针指向l1,l2中节点数多的那一个
最后返回head
```c
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
struct ListNode* rec1 = l1;
struct ListNode* rec2 = l2;
struct ListNode* head;
struct ListNode* fwd;
int num1[100] = {0};
int num2[100] = {0};
int sum[100] = {0};
char carry_over = 0; //进位标志
char length1 = 1;
char length2 = 1;
char length3 = 1;
char cont = 1;
num1[0] = rec1->val;
num2[0] = rec2->val;
rec1 = rec1->next;
rec2 = rec2->next;
while(rec1){
num1[cont] = rec1->val;
rec1 = rec1->next;
length1++;
cont++;
}
cont = 1;
while(rec2){
num2[cont] = rec2->val;
rec2 = rec2->next;
length2++;
cont++;
}
cont = 1;
if(length1 >= length2){
for(char i = 0; i <= length1; ++i){
if(num1[i] + num2[i] + carry_over > 9){
sum[i] = (num1[i] + num2[i] + carry_over) % 10;
carry_over = 1;
}
else{
sum[i] = num1[i] + num2[i] + carry_over;
carry_over = 0;
}
}
if(sum[length1])
length3 = length1 + 1;
else
length3 = length1;
}
else{
for(char j = 0; j <= length2; ++j){
if(num1[j] + num2[j] + carry_over > 9){
sum[j] = (num1[j] + num2[j] + carry_over) % 10;
carry_over = 1;
}
else{
sum[j] = num1[j] + num2[j] + carry_over;
carry_over = 0;
}
}
if(sum[length2])
length3 = length2 + 1;
else
length3 = length2;
}
if(length3 > length1 && length3 > length2 && length1 >= length2){
struct ListNode* rootp = (struct ListNode*)malloc(sizeof(struct ListNode));
rootp->val = sum[0];
rootp->next = l1;
head = rootp;
rootp = rootp->next;
while(rootp){
rootp->val = sum[cont];
cont++;
rootp = rootp->next;
}
}
else if(length3 > length1 && length3 > length2 && length1 < length2){
struct ListNode* rootp = (struct ListNode*)malloc(sizeof(struct ListNode));
rootp->val = sum[0];
rootp->next = l2;
head = rootp;
rootp = rootp->next;
while(rootp){
rootp->val = sum[cont];
cont++;
rootp = rootp->next;
}
}
else {
if(length1 >= length2){
l1->val = sum[0];
head = l1;
l1 = l1->next;
while(l1){
l1->val = sum[cont];
cont++;
l1 = l1->next;
}
}
else{
l2->val = sum[0];
head = l2;
l2 = l2->next;
while(l2){
l2->val = sum[cont];
cont++;
l2 = l2->next;
}
}
}
return head;
}