LeetCode 第2题两数相加（附java和python代码）

给你两个非空 的链表，表示两个非负的整数。它们每位数字都是按照逆序的方式存储的，并且每个节点只能存储 一位数字。

请你将两个数相加，并以相同形式返回一个表示和的链表。

你可以假设除了数字 0 之外，这两个数都不会以 0 开头。
链接：题目链接

解法：

1、注意进位问题

2、注意将末尾的0去掉

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode head = new ListNode(0);
        ListNode cur = head;
        while(l1!=null&&l2!=null){

            cur.val += l1.val + l2.val;
            if(cur.val>9){
                cur.val -= 10;
                cur.next = new ListNode(1);
            }

            if(cur.next==null){
                cur.next = new ListNode(0);

            }
            cur = cur.next;
            l1 = l1.next;
            l2 = l2.next;
        }
        while(l1!=null){
            cur.val += l1.val;
            if(cur.val>9){
                cur.val -= 10;
                cur.next = new ListNode(1);
            }
            if(cur.next==null){
                cur.next = new ListNode(0);

            }
            cur = cur.next;
            l1 = l1.next;
        }

        while(l2!=null){
            cur.val += l2.val;
            if(cur.val>9){
                cur.val -= 10;
                cur.next = new ListNode(1);
            }
            if(cur.next==null){
                cur.next = new ListNode(0);

            }
            cur = cur.next;
            l2 = l2.next;
        }
        if(cur.val>0){
            return head;
        }
        cur = head;
        while(cur!=null){
            if(cur.next.next==null&&cur.next.val==0){
                cur.next = null;
            }
            cur = cur.next;
        }

        return head;
    }
}

Python代码

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        head = ListNode(0)
        cur = head 
        while l1 is not None and l2 is not None:
            cur.val += l1.val + l2.val 
            if cur.val > 9:
                cur.val -= 10
                cur.next = ListNode(1)
            if cur.next is None:
                cur.next = ListNode(0)
            
            cur = cur.next
            l1 = l1.next
            l2 = l2.next
        
        while l1 is not None:
            cur.val += l1.val 
            if cur.val > 9:
                cur.val -= 10
                cur.next = ListNode(1)
            if cur.next is None:
                cur.next = ListNode(0)

            cur = cur.next
            l1 = l1.next

        while l2 is not None:
            cur.val += l2.val 
            if cur.val > 9:
                cur.val -= 10
                cur.next = ListNode(1)
            if cur.next is None:
                cur.next = ListNode(0)
            cur = cur.next
            l2 = l2.next

        if cur.val > 0:
            return head 
        
        cur = head 
        while cur is not None:
            if cur.next.next is None and cur.next.val == 0:
                cur.next = None 
            cur = cur.next 
        return head