LeetCode 2. Add Two Numbers

2. 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

三、解题思路

顺序遍历

• 这道题比较简单，但需要考虑的情况比较多。由于数字是按照反序列存储的，就是个位在最前面。设置一个变量add 表示是否需要进位，然后从头开始一起遍历两个链表，只要有一个遍历完了就退出。
• 然后再一次检查两个链表，根据add计算出是否需要进位以及计算之后的值，把剩余的部分位加进来。注意，如果两个链表都遍历完了，但是add==1 那么说明最高位需要进位，这时候需要新建一个节点，val设置为1 添加到链表的末尾。
• 我们需要设置头尾两个指针，头指针用来记录返回值，尾指针用来添加新的元素。

/**
 * 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* p1 = l1, *p2 = l2;
        ListNode* head = NULL, *tail = NULL;
        int add = 0;
        while (p1 && p2)
        {
            ListNode *node = new ListNode(0);
            int val1 = p1->val, val2 = p2->val;
            int ret = val1 + val2 + add;
            if(ret < 10) {node->val = ret; add = 0;}
            else {node->val = ret - 10; add = 1;}
            p1 = p1->next;
            p2 = p2->next;
            if(head == NULL) {head = node;tail = head;}
            else {tail->next = node; tail = node;}
        }
        while(p1){
            ListNode *node = new ListNode(0);
            int ret = p1->val + add;
            if(ret < 10) {node->val = ret; add = 0;}
            else{node->val = ret - 10;add = 1;}
            p1 = p1->next;
            tail->next = node;
            tail = node;
        }
        while(p2){
            ListNode *node = new ListNode(0);
            int ret = p2->val + add;
            if(ret < 10){node->val = ret; add = 0;}
            else{ node->val = ret - 10; add = 1;}
            p2 = p2->next;
            tail->next = node;
            tail = node;
        }
        if(add >0){
            ListNode *node = new ListNode(1);
            tail->next = node;
        }
        return head;
    }
};