Leetcode Algorithm No.2 Add Two Numbers

You are given two linked lists representing two non-negativenumbers.

 Thedigits are stored in reverse order and each of their nodes contain a singledigit. Add the two numbers and return it as a linked list.

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

 

学会如何用Python 实现链表

链表是一种物理 存储单元上非连续、非顺序的 存储结构, 数据元素的 逻辑顺序是通过链表中的指针链接次序实现的。

资料来自ThinkPython: How to Think Like a Computer Scientist

http://greenteapress.com/thinkpython/html/chap17.html


完整代码如下,其中包括生成linklist的creatlink函数

''' define class linknode to store value and pointer'''
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None
''' transform an interger into linked list'''
def creatlink(num,head=[]):
    level = 10
    head = ListNode(num%level)
    node = head
    num = int(num/level)
    while num:
        node1 = ListNode(num%level)
        node.next = node1
        node = node1
        num = int(num / level)
    return head
''' main function'''
def addTwoNumbers(a, b):
    head = ListNode(0)
    p = head
    flag = 0
    while flag or a or b:
        if a:
            s1=a.val
            a = a.next
        else:
            s1=0
        if b:
            s2=b.val
            b = b.next
        else:
            s2=0
        su = s1+s2+flag
        p.next = ListNode(0)
        p = p.next
        p.val = su%10
        flag=int(su/10)
    return head.next
''' print all the values of a list'''            
def printlink(node):
    while node:
        print(node.val)
        node = node.next

a=0
b=0
l1 = creatlink(a)
l2 = creatlink(b)
printlink(l1)

su=addTwoNumbers(l1,l2)
printlink(su)
'''     
'''


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值