algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-13 22:35:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

添加0279.完全平方数java版本二解法

Browse Source
This commit is contained in:
ironartisan
2021-08-19 15:05:17 +08:00
parent aa4ce0f096
commit 4df16b4258
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0279.完全平方数.md
View File

@ -226,7 +226,7 @@ class Solution:
return dp[n] return dp[n]
def numSquares1(self, n: int) -> int: def numSquares1(self, n: int) -> int:
'''版本二''' '''版本二， 先遍历物品, 再遍历背包'''
# 初始化 # 初始化
nums = [i**2 for i in range(1, n + 1) if i**2 <= n] nums = [i**2 for i in range(1, n + 1) if i**2 <= n]
dp = [10**4]*(n + 1) dp = [10**4]*(n + 1)