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
此题的目的在于将两个链表的相对应位置的元素相加,保存在新的链表的相应位置,满十进一的加到下一位置上。
思路:
1.定义一个新链表dummy去保存新元素,定义一个进位carry去保存每一步的进位;
2.因为两个链表的长度可能不一致,所以需要判断两个链表当前是否为NULL,若都为NULL,则跳出循环,否则将为NULL的链表的元素记为0;
3.将两个链表对应位置的元素相加,十位保存在carry中,个位保存在val中,然后new出一个保存val值的节点,并让新链表对应位置指向该节点;
4.最后返回dummy.next即为所求结果。
/**
* 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 dummy(-1);
ListNode *pre = &dummy;
int carry = 0;
for(ListNode *t1 = l1,*t2 = l2;
t1 != NULL || t2 != NULL;
t1 = t1==NULL?NULL:t1->next,
t2 = t2==NULL?NULL:t2->next,
pre = pre->next
){
int v1 = t1==NULL?0:t1->val;
int v2 = t2==NULL?0:t2->val;
int val = (v1+v2+carry)%10;
carry = (v1+v2+carry)/10;
pre->next = new ListNode(val);
}
if(carry > 0){
pre->next = new ListNode(carry);
}
return dummy.next;
}
};