题目:
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)
{
ListNode *newList = new ListNode(0);//新链表,保存两个链表的和,头结点置为0,不属于两个链表和的范围
int carry = 0 ;//进位
ListNode *p = newList;
ListNode *p1 = l1;
ListNode *p2 = l2;
//循环结束条件是直到长的链表遍历完,短的链表不够的位用0与长链表相应的位相加
while(p1 != NULL || p2 != NULL)
{
//num1保存当前p1结点的值,用于后面相加,如果p1到达尾部,则num1为0
int num1 = 0;
if(p1 != NULL)
{
num1 = p1->val ;
p1 = p1->next;
}
int num2 = 0;
if(p2 != NULL)
{
num2 = p2->val;
p2 = p2->next;
}
int num =( num1 + num2 + carry ) % 10;//求和然后对10取余
carry = (num1 + num2 + carry ) / 10;//进位为求和/10
p->next = new ListNode(num);//新申请一个结点,值为刚才求的num,接到p后
p = p->next;
}
//求到最后一位还有进位,则需要在申请一个结点,置为1
if(carry > 0 )
{
p->next = new ListNode(1);
}
return newList->next;
}
};