LintCode 两个链表的和

你有两个用链表代表的整数，其中每个节点包含一个数字。数字存储按照在原来整数中相反的顺序，使得第一个数字位于链表的开头。写出一个函数将两个整数相加，用链表形式返回和。
You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1’s digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list.

样例
给出两个链表 3->1->5->null 和 5->9->2->null，返回 8->0->8->null
Example
Given 7->1->6 + 5->9->2. That is, 617 + 295.
Return 2->1->9. That is 912.
Given 3->1->5 and 5->9->2, return 8->0->8.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;      
 *     }
 * }
 */
public class Solution {
    /**
     * @param l1: the first list
     * @param l2: the second list
     * @return: the sum list of l1 and l2 
     */
    public ListNode addLists(ListNode l1, ListNode l2) {
        int carry = 0;
        ListNode head = new ListNode(0);
        ListNode p = l1, q = l2, r = head;
        while(null != p && null != q) {
            int sum = carry + p.val + q.val;
            carry = sum / 10;
            r.next = new ListNode(sum % 10);
            r = r.next;
            p = p.next;
            q = q.next;
        }
        ListNode l = (p == null ? q : p);
        while(null != l) {
            int sum = carry + l.val;
            carry = sum / 10;
            r.next = new ListNode(sum % 10);
            r = r.next;
            l = l.next;
        }
        if(carry != 0) {
            r.next = new ListNode(carry);
        }
        return head.next;
    }
}