1. 题目描述
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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
2. 解决思路
做这道题又让我去复习了一下链表的知识,毕竟好久没做了,链表指针的运用都忘得差不多了。复习了之后觉得这道题还是比较一般的利用链表结构求解的算法题,用链表来做两个数的加法运算,可以很好的解决大数相加溢出的问题。具体思路见代码注释:
3. 完整代码
#include<iostream>
using namespace std;
struct ListNode
{
int val;
ListNode *next;
ListNode(int x) :val(x), next(NULL){}
};
class Solution
{
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2){
ListNode l3(0);
ListNode *preNode = &l3;
int addNumber = 0;
ListNode *b1 = l1, *b2 = l2;
while (b1 != NULL || b2 != NULL || addNumber > 0)
//当l1和l2不为空或者addNumber>0任意一个条件成立
{
ListNode *node = new ListNode(0);//临时的结构体指针
int val1 = b1 ? b1->val : 0;//如果b1不为空,val1=b1->val,否则为空
int val2 = b2 ? b2->val : 0;//如果b2不为空,val2=b2->val,否则为空
b1 = b1 ? b1->next : NULL;//如果b1不为空,b1指向下一个链表节点,否则为空
b2 = b2 ? b2->next : NULL;//如果b2不为空,b2指向下一个链表节点,否则为空
node->val = (val1 + val2 + addNumber) % 10;
addNumber = (val1 + val2 + addNumber) / 10;
preNode->next = node;
preNode = node;
}
return l3.next;
}
};
int main()
{
ListNode * ln1_1 = new ListNode(2);
ListNode * ln1_2 = new ListNode(4);
ListNode * ln1_3 = new ListNode(3);
ln1_1->next = ln1_2;
ln1_2->next = ln1_3;
ListNode * ln2_1 = new ListNode(5);
ListNode * ln2_2 = new ListNode(6);
ListNode * ln2_3 = new ListNode(4);
ln2_1->next = ln2_2;
ln2_2->next = ln2_3;
Solution s;
ListNode *l3 = s.addTwoNumbers(ln1_1,ln2_1);
while (l3!=NULL)
{
cout << l3->val << " ";
l3 = l3->next;
}
return 0;
}