【LeetCode】2. Add Two Numbers

传送门：https://leetcode.com/problems/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.

二、示例

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

---

三、分析

涉及链表的知识，从左到右遍历链表，依次相加，每一个位置生成一个新的结点即可。

考虑边界条件：

• 进位的的处理：carry表示进位，当最后一位还有进位时，即使 l1 和 l2 均为NULL的情况下，还需要生成一个新的结点，所以while的条件中加入了 carry != 0 判断项。
• 返回头结点：当头结点为NULL的时候记录头结点，并且让p等于头结点；后续情况让 p->next 等于新的结点，并让 p 指向 p->next。

四、实现

/**
 * 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 *head = NULL,*p;
        int carry = 0, sum = 0;
        while(l1 != NULL || l2 != NULL || carry != 0)
        {
            sum = 0;
            if(l1 != NULL)
            {
                sum = sum + l1->val;
                l1 = l1->next;
            }
            if(l2 != NULL)
            {
                sum = sum + l2->val;
                l2 = l2->next;
            }
            sum = sum + carry;
            carry = sum / 10;
            sum = sum % 10;
            ListNode *newNode = new ListNode(sum);
            if(head == NULL)
            {
                head = newNode;
                p = newNode;
            }
            else{
                p->next = newNode;
                p = p->next;
            }
        }
        return head;
    }
};