链表求和
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
/**
* @param l1: the first list
* @param l2: the second list
* @return: the sum list of l1 and l2
*/
ListNode *addLists(ListNode *l1, ListNode *l2) {
// write your code here
ListNode *l=new ListNode(0),*tmp;
tmp=l;
ListNode *tl1=l1,*tl2=l2;
int addition=0;
while(tl1!=NULL&&tl2!=NULL)
{
tmp->next=new ListNode(0);//给链表的下一个分配空间,放在前面防止最后一位为0而不是NULL
tmp=tmp->next;
int sum=tl1->val+tl2->val;
sum+=addition;
addition=sum/10;
sum=sum%10;
tmp->val=sum;
tl1=tl1->next;
tl2=tl2->next;
}
while(tl1!=NULL)
{
tmp->next=new ListNode(0);
tmp=tmp->next;
tmp->val=(tl1->val+addition)%10;
addition=(tl1->val+addition)/10;
tl1=tl1->next;
}
while(tl2!=NULL)
{
tmp->next=new ListNode(0);
tmp=tmp->next;
tmp->val=(tl2->val+addition)%10;
addition=(tl2->val+addition)/10;
tl2=tl2->next;
}
if(addition!=0)//防止两个子链都为空,却有进位的情况
{
tmp->next=new ListNode(addition);
}
return l->next;
}
};