【力扣】两数相加 https://leetcode-cn.com/problems/add-two-numbers/

https://leetcode-cn.com/problems/add-two-numbers/

/**
 * 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) {
        
        //先从左到右逐位计算
        if (l1 == null && l2 == null) {
            return null;
        }
        if (l1 == null) {
            return l2;
        }
        if (l2 == null) {
            return l1;
        }
        ListNode ret;
        int h = (l1.val + l2.val) / 10;
        ret = new ListNode((l1.val + l2.val) % 10);
        ListNode left = l1.next;
        ListNode right = l2.next;
        int h2 = h;
        ListNode ret2 = ret;
        ListNode t;
        while (left != null && right != null) {
            t = new ListNode((left.val + right.val + h2 ) % 10);
            h2 = (left.val + right.val + h2 ) / 10;
            ret2.next = t;
            ret2 = t;
            left = left.next;
            right = right.next;
        }

        //没有遍历完的数组，值直接添加进去
        while (left != null) {
            
            t = new ListNode((left.val + h2) % 10);
            h2 = (left.val + h2) / 10;
            ret2.next = t;
            ret2 = t;
            left = left.next;
        }
        while (right != null) {
            
            t = new ListNode((right.val + h2) % 10);
            h2 = (right.val + h2) / 10;
            ret2.next = t;
            ret2 = t;
            right = right.next;
        }
        if (h2 > 0) {
            t = new ListNode(h2);
            ret2.next = t;
        }
        return ret;
    }
}