mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 19:44:45 +08:00
添加0279.完全平方数python3版本一解法
This commit is contained in:
@ -217,6 +217,22 @@ class Solution:
|
|||||||
Python3:
|
Python3:
|
||||||
```python
|
```python
|
||||||
class Solution:
|
class Solution:
|
||||||
|
'''版本一,先遍历背包, 再遍历物品'''
|
||||||
|
def numSquares(self, n: int) -> int:
|
||||||
|
dp = [n] * (n + 1)
|
||||||
|
dp[0] = 0
|
||||||
|
# 遍历背包
|
||||||
|
for j in range(1, n+1):
|
||||||
|
for i in range(1, n):
|
||||||
|
num = i ** 2
|
||||||
|
if num > j: break
|
||||||
|
# 遍历物品
|
||||||
|
if j - num >= 0:
|
||||||
|
dp[j] = min(dp[j], dp[j - num] + 1)
|
||||||
|
return dp[n]
|
||||||
|
|
||||||
|
class Solution:
|
||||||
|
'''版本二, 先遍历物品, 再遍历背包'''
|
||||||
def numSquares(self, n: int) -> int:
|
def numSquares(self, n: int) -> int:
|
||||||
# 初始化
|
# 初始化
|
||||||
# 组成和的完全平方数的最多个数,就是只用1构成
|
# 组成和的完全平方数的最多个数,就是只用1构成
|
||||||
|
Reference in New Issue
Block a user