【leetcode】2. Add Two Numbers 【medium】

题目：

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

Subscribe to see which companies asked this question

解题思路：

先判断两个链表哪个较长，然后类似大整数加法，用变量carry标记进位数。只需再注意下较小的链表是否走到头了。如果一样长，而且有进位，还会有最后一种特殊情况发生，要增加链表长度。

代码：

class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {


ListNode*h=l1;
ListNode*p=l1;
int c1=0,c2=0;
while(h!=NULL)
{

c1++;
h=h->next;
}

h=l2;
p=l2;
while(h!=NULL)
{

c2++;
h=h->next;
}

if(c2>c1)
{
ListNode*temp=l1;
l1=l2;
l2=temp;
}


int carry=0;
int sum=0;ListNode*t=l1;

while(l1!=NULL)
{ if(l2!=NULL)
{
sum=l1->val+l2->val+carry;

if(sum>=10)
{
sum=sum-10;
l1->val=sum;
carry=1;
}
else
{
l1->val=sum;
carry=0;
}




l2=l2->next;
}
else
{
sum=l1->val+carry;
if(sum>=10)
{
l1->val=0;
carry=1;
}
else
{
l1->val=sum;
carry=0;
}


}
if(carry==1&&l1->next==NULL)
{

l1->next=new ListNode(0);
}

l1=l1->next;
}




return t;




}
};