题目: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的结点数为m,链表2为n,则
时间复杂度为O(max(m,n)),空间复杂度为O(max(m,n))
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode *head=new ListNode(0);
head->next=NULL;
ListNode *p=head;
int shang=0;
while((l1!=NULL)||(l2!=NULL))
{
if(l1==NULL)
{
ListNode *l=new ListNode((l2->val+shang)%10);
shang=(l2->val+shang)/10;
p->next=l;
p=p->next;
l2=l2->next;
}
else if(l2==NULL)
{
ListNode *l=new ListNode((l1->val+shang)%10);
shang=(l1->val+shang)/10;
p->next=l;
p=p->next;
l1=l1->next;
}
else if((l1!=NULL)&&(l2!=NULL))
{
ListNode *l=new ListNode((l1->val+l2->val+shang)%10);
p->next=l;
p=p->next;
shang=(l1->val+l2->val+shang)/10;
l1=l1->next;l2=l2->next;
}
}
if(shang)
{
ListNode *l=new ListNode(shang);
p->next=l;
p=p->next;
}
return head->next;
}
};