【LeetCode】Add Two Numbers

Add Two Numbers 
Total Accepted: 17137 Total Submissions: 75794 My Submissions
You are given two linked lists representing two non-negative numbers. 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
【解题思路】
大数相加，按位求和，注意进位问题

Java AC 704ms

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public 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 node = new ListNode(0);
		ListNode point = node;
		int carry = 0;
		while (l1 != null && l2 != null) {
			int val = l1.val + l2.val;
			val += carry;
			carry = 0;
			if (val >= 10) {
				int temp = val;
				val %= 10;
				carry += temp / 10;
			}
			point.next = new ListNode(val);
			point = point.next;
			l1 = l1.next;
			l2 = l2.next;
		}
		while (l1 != null) {
			int val = l1.val + carry;
			carry = 0;
			if (val >= 10) {
				int temp = val;
				val %= 10;
				carry += temp / 10;
			}
			point.next = new ListNode(val);
			point = point.next;
			l1 = l1.next;
		}
		while (l2 != null) {
			int val = l2.val + carry;
			carry = 0;
			if (val >= 10) {
				int temp = val;
				val %= 10;
				carry += temp / 10;
			}
			point.next = new ListNode(val);
			point = point.next;
			l2 = l2.next;
		}
		if(carry != 0){
		    point.next = new ListNode(carry);
			point = point.next;
		}
		return node.next;
	}
}

Python AC 568ms

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    # @return a ListNode
    def addTwoNumbers(self, l1, l2):
        if l1 is None and l2 is None:
            return None
        node = ListNode(0)
        point = node
        carry = 0

        while l1 is not None and l2 is not None:
            val = l1.val + l2.val
            val += carry
            carry = 0
            if val >= 10:
                temp = val
                val %= 10
                carry += temp / 10
            point.next = ListNode(val)
            point = point.next
            l1 = l1.next
            l2 = l2.next

        while l1 is not None:
            val = l1.val + carry
            carry = 0
            if val >= 10:
                temp = val
                val %= 10
                carry += temp / 10
            point.next = ListNode(val)
            point = point.next
            l1 = l1.next

        while l2 is not None:
            val = l2.val + carry
            carry = 0
            if val >= 10:
                temp = val
                val %= 10
                carry += temp / 10
            point.next = ListNode(val)
            point = point.next
            l2 = l2.next

        if carry != 0:
            point.next = ListNode(carry)
            point = point.next
        return node.next