[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.

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

Solution

两个倒序的链表相加就相当于常见的两个数相加的思路，从个位开始，每一位的相加和是2个数在该位的和模10，逢10进1，一直到将2个数的每一位分别相加完，最后一位同样逢10进1。为了方便，可以使用头结点head, 这样个位的操作就和其他位的操作一致了，记得最后一位的相加和如果超过10，仍要增加一个值为1的链表结点。时间复杂度是O(max(l₁,l₂))。

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    ListNode p1 = l1;
    ListNode p2 = l2;
    ListNode result = new ListNode(0);
    ListNode head = result;
    int sum = 0;
    while (p1 !=null || p2 !=null){
        sum = sum/10;
        if (p1 != null){
            sum += p1.val;
            p1 = p1.next;
        }
        if (p2 != null){
            sum += p2.val;
            p2 = p2.next;
        }
        result.next = new ListNode(sum%10);
        result = result.next;
    }
    if (sum/10 == 1)
    result.next = new ListNode(1);
    return head.next;
}