You are given two non-empty linked lists representing two non-negative integers. 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.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 Explanation: 342 + 465 = 807.
代码:
/**
* 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 *l11=l1, *l22=l2;
ListNode *l3=new ListNode(0);
ListNode *l4=l3;
int flag=0;
int sum;
while(l11&&l22){
sum=(l11->val+l22->val+flag)%10;
flag=(l11->val+l22->val+flag)/10;
ListNode *t=new ListNode(sum);
l4->next=t;
l4=t;
l11=l11->next;
l22=l22->next;
}
while(l11){
sum=(l11->val+flag)%10;
flag=(l11->val+flag)/10;
ListNode *t=new ListNode(sum);
l4->next=t;
l4=t;
l11=l11->next;
}
while(l22){
sum=(l22->val+flag)%10;
flag=(l22->val+flag)/10;
ListNode *t=new ListNode(sum);
l4->next=t;
l4=t;
l22=l22->next;
}
if(flag){
ListNode *t=new ListNode(1);
l4->next=t;
l4=t;
}
l4->next=NULL;
return l3->next;
}
};
结论:好久没用过链表了。。。。。咸鱼
这题不怎么难,就进位那里有点坑=(