[leetcode] 2. Add Two Numbers（链表、大数相加）

Add Two Numbers

描述

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

分析

考察链表的基本操作。
分为两个步骤来做：第一遍对应位相加直接保存结果，第二遍处理进位情况。
注意点在代码中给出。

我的代码

/**
 * 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* rlt = NULL;
        if (l1 == NULL || l2 == NULL) return rlt;

        rlt = new ListNode(0);
        rlt->val = l1->val + l2->val;
        l1 = l1->next;
        l2 = l2->next;

        //利用尾插法创建链表（要记住创建链表的过程）
        ListNode* r = rlt;
        while (l1 && l2)
        {
            ListNode* p = new ListNode(0);
            p->val = (l1->val + l2->val);
            l1 = l1->next;
            l2 = l2->next; 
            r->next = p; //将p放入链表尾端
            r = p;       //将r后移一个结点
        }
        //处理链表中没有参与相加的部分，直接添加到结果链表尾部
        if (l1)  r->next = l1;
        if (l2)  r->next = l2;

        //遍历一遍处理进位
        int carry = 0;
        ListNode* pp = rlt;
        ListNode* qq = pp;
        while (pp)
        {
            qq = pp;
            int val = (pp->val + carry) % 10; //这里要注意先把值暂存在val中不要直接改变pp->val
            carry = (pp->val + carry) / 10;
            pp->val = val;
            pp = pp->next;
        }
        if (carry > 0)   //处理最高位还要往前进一位的情况
        {
            ListNode* p = new ListNode(carry);
            qq->next = p;
        }
        return rlt;
    }
};