/**
* 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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int k=0,choice=1;
ListNode *L1=l1,*L2=l2,*pre1,*pre2;
while(l1!=NULL||l2!=NULL){
if(l1!=NULL&&l1->next==NULL){
pre1=l1;
}
if(l2!=NULL&&l2->next==NULL){
pre2=l2;
}
if(l1==NULL){
k=k+l2->val;
l2->val=k%10;
choice=2;
l2=l2->next;
}else if(l2==NULL){
k=k+l1->val;
l1->val=k%10;
choice=1;
l1=l1->next;
}else {
k=l1->val+l2->val+k;
l1->val=l2->val=k%10;
l1=l1->next;
l2=l2->next;
}
if(k>=10){
k=1;
}else k=0;
}
if(choice==1){
if(k==1){
ListNode *node = new ListNode(1);
pre1->next = node;
}
return L1;
}else{
if(k==1){
ListNode *node = new ListNode(1);
pre2->next = node;
}
return L2;
}
}
};