Leetcode_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 contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example1:
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.

Example2:
Input: l1 = [0], l2 = [0]
Output: [0]

Example3:
Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]

思路描述：两个逆序链表结点逐个相加，尾插法插入第三个链表当中，插入数字大小为sum=n1+n2+carry（进位）。最后两链表插入完后，还要判断carry位是否进位，如果进位还要新增一个结点来尾插到最后。 N进制进位表示位：carry = sum/N; 赋值操作用三元操作目 ‘？’来简化代码描述。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* l3=nullptr,*rear=nullptr;
        int carry = 0;
        while(l1||l2){
            int n1 = l1 ? l1->val:0;
            int n2 = l2 ? l2->val:0;
            int sum = n1 + n2 + carry;
            if(!l3){
                l3= rear = new ListNode(sum%10);
            }
            else{
                rear->next = new ListNode(sum%10);
                rear = rear->next;
            }
            carry = sum/10;
            if(l1){
                l1=l1->next;
            }
            if(l2){
                l2=l2->next;
            }
        }
        if(carry){
            rear->next=new ListNode(carry);
        }
        return l3;
    } 
};