题目描述:
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) {}
* };
*/
这个题目主要涉及数据结构以及边界的合理判定等。我也是通过多次编码最终完成。下面分享我的思路
1、两者相加需要判定是否>9做进位处理
2、两个列表的空值判定(为空则不处理其值)。
3、结束判定(两个列表当前指针为空,低一位的计算不需要进位)
4、处理完一个列表的数值将其指针指向下一个
完整解法代码:
class Solution {
public:
ListNode * addTwoNumbers(ListNode* l1, ListNode* l2) {
int val =l1->val + l2->val;
bool add1 = false;
if(val>9)
{
add1 = true;
val-=10;
}
ListNode* rnode = new ListNode(val);
add_func(l1->next, l2->next, rnode, add1);
return rnode;
}
void add_func(ListNode* l1, ListNode* l2, ListNode* rnode, bool add1 )
{
int val = 0;
if (true == add1)
val += 1;
if (nullptr != l1)
{
val += l1->val;
l1 = l1->next;
}
if (nullptr != l2)
{
val += l2->val;
l2 = l2->next;
}
if (0 == val && nullptr == l1 && nullptr == l2)
return;
if (val >9)
{
val -= 10;
add1 = true;
}
else
add1 = false;
ListNode* node = new ListNode(val);
if (nullptr != rnode)
{
rnode->next = node;
rnode = rnode->next;
return add_func(l1, l2, rnode, add1);
}
}
};