LeetCode-2两数相加（模拟）

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

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
     public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
            int carry = 0;
            int a = 0,b = 0;
            ListNode node = null;
            ListNode ans = null;
            while (l1 != null||l2 != null){

                if(l1 == null){
                    a = 0;
                }else {
                    a = l1.val;
                }
                if(l2 == null){
                    b = 0;
                }else {
                    b = l2.val;
                }

                int tmp =  a + b + carry;
                carry = 0;

                if(tmp>9){
                    tmp -= 10;
                    carry = 1;
                }
                if(node == null){
                    ans = node = new ListNode(tmp);
                }else {
                    node.next = new ListNode(tmp);
                    node = node.next;
                }


                if(l1 != null){
                    l1 = l1.next;
                }
                if(l2 != null){
                    l2 = l2.next;
                }
            }

            if(carry==1){
                node.next = new ListNode(1);
            }
            return ans;
        }
    }

上面是自己写的，太丑了
下面题解

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode head = null, tail = null;
        int carry = 0;
        while (l1 != null || l2 != null) {
            int n1 = l1 != null ? l1.val : 0;
            int n2 = l2 != null ? l2.val : 0;
            int sum = n1 + n2 + carry;
            if (head == null) {
                head = tail = new ListNode(sum % 10);
            } else {
                tail.next = new ListNode(sum % 10);
                tail = tail.next;
            }
            carry = sum / 10;
            if (l1 != null) {
                l1 = l1.next;
            }
            if (l2 != null) {
                l2 = l2.next;
            }
        }
        if (carry > 0) {
            tail.next = new ListNode(carry);
        }
        return head;
    }
}

注意进位，还有next时的更新

复杂度分析

时间复杂度：O(max(m,n))，其中 m 和 n 分别为两个链表的长度。遍历两个链表的全部位置，而处理每个位置只需要 O(1) 的时间。