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:

二、代码实现

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode dummyHead = new ListNode(0);
        ListNode p = l1,q = l2;
        int carry = 0;
        ListNode curr = dummyHead;
        while (p != null || q != null){
            int m = (p != null) ? p.val : 0;
            int n = (q != null) ? q.val : 0;

            int sum = m + n + carry;
            carry = sum / 10;  //进位

            curr.next = new ListNode(sum % 10);
            curr = curr.next;

            if(p != null){
                p = p.next;
            }
            if(q != null){
                q = q.next;
            }
        }

        if(carry > 0){
            curr.next = new ListNode(carry);
        }

        return dummyHead.next;
    }
}