LeetCode（2）：Add Two Numbers

Problem：

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.

给你两个非空链表，表示两个非负整数。 数字以相反的顺序存储并且它们的每个节点都包含一

个数字。 加两个数字并将其作为链接列表返回。

您可以假定这两个数字不包含任何前导零，数字0除外本身

Example：

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

---

Solution：

First (Definition for singly-linked list.)

public class ListNode {
    int val;
    ListNode next;

    ListNode(int x) {
        val = x;
    }
}

public class Soluton{
    public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode c1 = l1;          //引用赋值，指向同一地址
        ListNode c2 = l2;
        ListNode sentinel = new ListNode(0);
        ListNode d = sentinel;
        int sum = 0;
        while (c1 != null || c2 != null) {
            sum /=10;               //判断是否有进位
            if(c1 != null){         //判断是否还有数值
                sum += c1.val;
                c1 = c1.next;
            }
            if (c2 != null){        //判断是否还有数值
                sum += c2.val;
                c2  = c2.next;
            }
            d.next = new ListNode(sum % 10);  //sentinel也在添加相同的值
            d=d.next;
        }
        if(sum /10 == 1){
            d.next = new ListNode(1);
        }
        return sentinel.next;
    }
}