首页 > 代码库 > Add Two Numbers
Add Two Numbers
/**
* 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 *head = new ListNode(0);
ListNode *p = head,*q=NULL;
int num = 0;
int flag = 0;
while (l1!= NULL||l2!= NULL)
{
if (l1 != NULL && l2 != NULL)
{
int sum = l1->val + l2->val + flag;
flag=sum/10;
int Lsum = sum % 10;
p->val = Lsum;
q = p;
p->next = new ListNode(0);
p = p->next;
l1 = l1->next;
l2 = l2->next;
}
else if (l1 == NULL&&l2 != NULL)
{
int sum = l2->val + flag;
flag=sum/10;
int Lsum = sum % 10;
p->val = Lsum;
q = p;
p->next = new ListNode(0);
p = p->next;
l2=l2->next;
}
else
{
int sum = l1->val + flag;
flag=sum/10;
int Lsum = sum % 10;
p->val = Lsum;
q = p;
p->next = new ListNode(0);
p = p->next;
l1=l1->next;
}
}
if (l1 == NULL&&l2 == NULL)
{
if (flag == 0)
{
delete p;
q->next = NULL;
}
else
p->val = flag;
return head;
}
}
};本文出自 “算法设计” 博客，请务必保留此出处http://shineprince.blog.51cto.com/10293320/1913899
Add Two Numbers
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。