题目链接:https://leetcode.com/problems/add-two-numbers/
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;
* struct ListNode *next;
* };
*/
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) {
int sum = 0;
struct ListNode* dummy = (struct ListNode*)malloc(sizeof(struct ListNode));
struct ListNode* p = dummy;
while(l1 != NULL || l2 != NULL) {
p->next = (struct ListNode* )malloc(sizeof(struct ListNode));
p = p->next;
if(l1 != NULL) {
sum += l1->val;
l1 = l1->next;
}
if(l2 != NULL) {
sum += l2->val;
l2 = l2->next;
}
p->val = sum % 10;
sum /= 10;
}
if(sum) {
p->next = (struct ListNode *)malloc(sizeof(struct ListNode));
p = p->next;
p->val = sum;
}
p->next = NULL; //尾节点指向空
p = dummy;
free(dummy);
return p->next;
}