【Java】【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 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，要注意两个数相加当前位要写取模后的值。最后如果carry!=0, 最高位进位

代码如下：

public class AddTwoNumbers
{

    public static void main(String[] args)
    {
        /**
         * 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.
         */
        ListNode ln11 = new ListNode(2);
        ListNode ln12 = new ListNode(4);
        ListNode ln13 = new ListNode(3);
        ln11.next = ln12;
        ln12.next = ln13;
        ln13.next = null;
        ListNode ln21 = new ListNode(5);
        ListNode ln22 = new ListNode(6);
        ListNode ln23 = new ListNode(4);
        ln21.next = ln22;
        ln22.next = ln23;
        ln23.next = null;
        LeetCodeUtil.printNodeList(addTwoNumbers(ln11, ln21));
    }

    public static ListNode addTwoNumbers(ListNode l1, ListNode l2)
    {
        int carry = 0;
        ListNode l3 = new ListNode(0);
        ListNode preHead = l3;
        while (l1 != null || l2 != null)
        {
            if (l1 != null)
            {
                carry += l1.val;
                l1 = l1.next;
            }
            if (l2 != null)
            {
                carry += l2.val;
                l2 = l2.next;
            }
            l3.next = new ListNode(carry % 10);
            l3 = l3.next;
            carry = carry / 10;
        }
        if (carry != 0)
        {
            l3.next = new ListNode(carry);
        }
        return preHead.next;
    }

}