[Leetcode] 2. Add Two Numbers

最新推荐文章于 2017-12-19 15:34:17 发布

stlst

最新推荐文章于 2017-12-19 15:34:17 发布

阅读量181

点赞数

分类专栏： python LeetCode 文章标签： leetcode Python

本文链接：https://blog.csdn.net/stlst/article/details/54730919

版权

LeetCode 同时被 2 个专栏收录

34 篇文章 0 订阅

订阅专栏

python

29 篇文章 0 订阅

订阅专栏

Problem:

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 contain a single digit. Add the two numbers and return it as a linked list.

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

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

思路：
自定义链表，模拟加法操作。注意两个链表长度不一样的情况。

Solution：

# -*- coding: utf-8 -*-
"""
Created on Mon Jan 09 11:20:12 2017

@author: liangsht
"""
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 = 0
        node1 = l1
        node2 = l2

        while (node1 != None or node2 != None):
            if(node1 == None):
                res = node2.val + temp
            elif(node2 == None):
                res = node1.val + temp
            else:
                res = node1.val + node2.val + temp

            if(res>9):
                temp = 1
                res = res - 10
            else:
                temp = 0
            result = ListNode(res)
            if node1 == l1:
                head = result
                previous = head
            else:
                previous.next = result
                previous = result
            if node1 != None:
                node1 = node1.next
            if node2 != None:
                node2 = node2.next
        if(temp ==1):
            previous.next = ListNode(temp)
            previous.next.next = None
        else:
            previous.next = None
        return head