【LeetCode-2】Add Two Numbers

时隔4年，继续记录一下自己的成长历程吧。
题目：medium
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 contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example 1:
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.

Example 2:
Input: l1 = [0], l2 = [0]
Output: [0]

Example 3:
Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]

Constraints:
The number of nodes in each linked list is in the range [1, 100].
0 <= Node.val <= 9
It is guaranteed that the list represents a number that does not have leading zeros.

这道题的目标是计算两数之和，每个数使用链表存储，链表中的每一个节点代表一位数字(取值范围[0,9])，链表的头结点存储的是数的最低位，尾结点存储的是数的最高位。题目比较容易，需要注意的是两个数位数不一致的情况以及加法满10进位。

15年(一刷): O(N)

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

16年(二刷): 当时为了学python基本语法，开始用python写题，O(N)

    def addTwoNumbers(self, l1, l2):  
        ret = ListNode(0)  
        cur = ret  
  
        sum = 0  
        while True:  
            if l1 != None:  
                sum += l1.val  
                l1 = l1.next  
            if l2 != None:  
                sum += l2.val  
                l2 = l2.next  
  
            cur.val = sum % 10  
            sum /= 10  
            if l1 != None or l2 != None or sum != 0:  
                cur.next = ListNode(0)  
                cur = cur.next  
            else:  
                break  
  
        return ret  

19年(三刷): O(N)

    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode res = new ListNode(0), head = res;
        int carry = 0;
        while (l1 != null || l2 != null) {
            int value1 = (l1 == null ? 0 : l1.val);
            int value2 = (l2 == null ? 0 : l2.val);
            int sum = value1 + value2 + carry;
            carry = sum / 10;
            ListNode temp = new ListNode(sum % 10);
            head.next = temp;
            head = head.next;

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

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

        if (carry > 0) {
            head.next = new ListNode(carry);
        }

        return res.next;
    }