题目要求如下:
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
算法思想:申请一个新的链表,逐次添加节点,节点值存储的就是当前位的数值,有标记位标记是否有进位。需要注意的是,当两个链表都遍历完以后,可能还会存在进位,需要单独处理。
参考代码如下:
/**
* 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) {//需要返回链表指针
if(l1==NULL && l2==NULL)
return NULL;
ListNode * head = NULL;
ListNode * pre = NULL;
int flag = 0;
while(l1&&l2)//链表都为非空,逐次添加节点
{
ListNode *node = new ListNode(l1->val+l2->val+flag);
flag = (node->val)/10;//进位标记
(node->val) %= 10;
if(head==NULL)
head = node;
else
pre->next = node;//添加到当前需要输出的链表
pre = node;
l1 = l1->next;
l2 = l2->next;
}
while(l1)//l2为空之后,遍历l1
{
ListNode *node = new ListNode(l1->val+flag);
flag = (node->val)/10;
(node->val) %= 10;
if(head==NULL)
head = node;
else
pre->next = node;
pre = node;
l1 = l1->next;
}
while(l2)
{
ListNode *node = new ListNode(l2->val+flag);
flag = (node->val)/10;
(node->val) %= 10;
if(head==NULL)
head = node;
else
pre->next = node;
pre = node;
l2 = l2->next;
}
if(flag>0)//最后有进位,需要增加节点考虑进位
{
ListNode * node = new ListNode(flag);
pre->next = node;
}
return head;
}
};
如果您发现有什么问题或者可以优化的地方,欢迎指教!