X+1

分类

题解(5)

/ 注册

全部文章（共5篇）

题解 | #01背包#

dp[i]表示体积为i的背包能装最大的重量 class Solution: def knapsack(self , V , n , vw ): dp=[0]*(V+1) for i in range(n): for j in range...

2021-05-03

0 460

题解 | #跳台阶#

class Solution: def jumpFloor(self, number): if number==0: return 0 elif number==1: return 1 elif ...

2021-04-29

0 314

题解 | #和为S的两个数字#

class Solution: def FindNumbersWithSum(self, array, tsum): i,j=0,len(array)-1 while i<j: if array[i]+array[j]==tsum...

2021-04-29

0 342

题解 | #连续子数组的最大和#

class Solution: def FindGreatestSumOfSubArray(self, array): size=len(array) if size==1: return array[0] else: ...

2021-04-29

0 306

题解 | #连续子数组的最大和#

# -*- coding:utf-8 -*- class Solution: def cutRope(self, number): if number<=3: return number-1 else: a...

2021-04-29

0 362