8.21笔记

最新推荐文章于 2024-08-22 14:29:25 发布

Sino1996

最新推荐文章于 2024-08-22 14:29:25 发布

阅读量93

点赞数

分类专栏：提升

本文链接：https://blog.csdn.net/sinat_35325378/article/details/99941680

版权

提升专栏收录该内容

67 篇文章 0 订阅

订阅专栏

445. 两数相加 II

class Solution(object):
    def addTwoNumbers(self, l1, l2):
        """
        :type l1: ListNode
        :type l2: ListNode
        :rtype: ListNode
        """
        if not l1 and not l2:
            return None
        a = 0
        b = 0
        l3 = ListNode(0)
        while l1:
            a = a*10 + l1.val
            l1 = l1.next
        while l2:
            b = b*10 + l2.val
            l2 = l2.next
        c = a + b
        cur = l3
        for s in str(c):
            cur.next = ListNode(int(s))
            cur = cur.next
        return l3.next

119. 杨辉三角 II

class Solution(object):
    def getRow(self, rowIndex):
        """
        :type rowIndex: int
        :rtype: List[int]
        """
        res = [1]*(rowIndex+1)
        for i in range(2,rowIndex+1):
            for j in range(i-1,0,-1):
                res[j] += res[j-1]
        return res