链表
思路
第一次做链表的题,熟悉一下格式操作,别的都没啥难的
见: https://leetcode-cn.com/problems/add-two-numbers/solution/liang-shu-xiang-jia-by-leetcode-solution/
代码
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode *head=nullptr,*tail=nullptr;
int cnt=0;
while(l1||l2)
{
int n1=0,n2=0;
if(l1)
n1=l1->val;
if(l2)
n2=l2->val;
int sum=n1+n2+cnt;
if(!head)
head=tail=new ListNode(sum%10);
else
{
tail->next=new ListNode(sum%10);
tail=tail->next;
}
if(l1)
l1=l1->next;
if(l2)
l2=l2->next;
cnt=sum/10;
}
if(cnt)
tail->next=new ListNode(cnt);
return head;
}
};