leetcode第2题——**Add Two Numbers

题目

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

思路

考察单链表的基本操作，注意两个链表中的值相加后大于10要进位，可以用变量add和carry分别存储和、进位，add是结果链表中的值，判断add>9则carry=1，然后到下一个节点时初始化为add=carry,carry=0。另外，代码中给出的ListNode类是必须的，不然在自己的编译器上编译无法通过。

代码

Python

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

class Solution(object):
    def addTwoNumbers(self,l1,l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        temp = ListNode(0)
        l3 = temp
        carry = 0
        while l1 or l2 or carry:
            add,carry = carry,0
            if l1:
                add += l1.val
                l1 = l1.next
            if l2:
                add += l2.val
                l2 = l2.next
            if add > 9:
                add -= 10
                carry = 1
            l3.next = ListNode(add)
            l3 = l3.next
        return temp.next

Java

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode l3 = new ListNode(0);
        ListNode temp = l3;
        int carry = 0;
        int add;
        while((l1 != null) || (l2 != null) || (carry != 0))
        {
            add = carry;
            carry = 0;
            if(l1 != null)
            {
                add += l1.val;
                l1 = l1.next;
            }
            if(l2 != null)
            {
                add += l2.val;
                l2 = l2.next;
            }
            if(add > 9)
            {
                add -= 10;
                carry = 1;
            }
            l3.next = new ListNode(add);
            l3 = l3.next;
        }
        return temp.next;
    }
}