【链表】链表求和

一、题目

力扣原题：https://leetcode-cn.com/problems/sum-lists-lcci/submissions/

二、双指针模拟

/**
 * 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 result = new ListNode(-1);
        ListNode curNode = result;  

        int carrier = 0;
        while (null != l1 && null != l2) {
            // 计算当前位
            int val = l1.val + l2.val + carrier;
            curNode.next = new ListNode(val % 10);
            curNode = curNode.next;

            // 计算进位
            carrier = val / 10;

            // 指针后移
            l1 = l1.next;
            l2 = l2.next;
        }

        while (null != l1)