algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 23:28:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1865 from ZerenZhang2022/patch-7

Browse Source 
Update 0279.完全平方数.md
This commit is contained in:
程序员Carl
2023-01-23 10:49:07 +08:00
committed by GitHub
parent 7bc90d1b2b 835c9222de
commit 2ffbb82aa8
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

@ -230,7 +230,7 @@ class Solution:
# 遍历物品
for num in nums:
# 遍历背包
for j in range(num, n + 1)
for j in range(num, n + 1):
dp[j] = min(dp[j], dp[j - num] + 1)
return dp[n]
```