赵二的刷题日记018《两数相加II》

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.

Example 1:

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

Example 2:

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

Example 3:

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

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int cf = 0;//进位标识符
        int sum = 0;//存储两个节点的值的和
        int a1 = 0;//存储l1节点的值
        int a2 = 0;//存储l2节点的值
        ListNode d1 = null;
        ListNode d2 = null;
        
        while (l1 != null || l2 != null) {
            a1 = l1 == null ? 0 : l1.val;
            a2 = l2 == null ? 0 : l2.val;
            sum = a1 + a2 + cf;
            cf = sum / 10;

            if (d1 == null) {
                d1 = d2 = new ListNode(sum % 10);
            } else {
                d2.next = new ListNode(sum % 10);
                d2 = d2.next;
            }

            if (l1 != null)
                l1 = l1.next;

            if (l2 != null)
                l2 = l2.next;
        }
        
        if (cf == 1) //最后一次计算有进位
            d2.next = new ListNode(1);
        
        return d1;
    }
}