[编程练习][Add Two Numbers]<LeetCode-2>

5 篇文章 0 订阅
3 篇文章 0 订阅

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


题目来自: https://oj.leetcode.com/problems/add-two-numbers/


# 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):
        prev = None
        val = 0
        while l1 != None or l2 != None or val != 0:
            if l1 is not None:
                val += l1.val
                l1 = l1.next
            if l2 is not None:
                val += l2.val
                l2 = l2.next
            
            curNode = ListNode(val%10)
            val = 0 if val < 10 else 1
            if prev is not None:
                prev.next = curNode
            else:
                retList = curNode
            prev = curNode
        return retList

这道题目其实是很简单的,LeetCode 网站标注的难度是Medium.

就是考察链表使用,另外数字的相加进位,和链表长度不同是考察编码者是否细心。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值