给定正整数 n,找到若干个完全平方数(比如 1, 4, 9, 16, …)使得它们的和等于 n。你需要让组成和的完全平方数的个数最少。
示例:
输入: n = 12
输出: 3
解释: 12 = 4 + 4 + 4.
import math
class Solution:
def numSquares(self, n: int) -> int:
#动态规划
opt = [0x7FFFFFFF] * (n+1)
opt[0] = 0
for i in range(1, n+1):
for j in range(1, i+1):
if i - j*j >= 0:
opt[i] = min(opt[i], opt[i-j*j] + 1)
return opt[n]
print(Solution().numSquares(12))
class Solution2:
def numSquares(self, n: int) -> int:
#动态规划
squart_nums = [i*i for i in range(0,int(math.sqrt(n))+1)]
opt = [float('inf')] * (n+1)
opt[0] = 0
for i in range(1, n+1):
for j in squart_nums:
if i - j < 0:
break
opt[i] = min(opt[i], opt[i-j] + 1)
return opt[n]
opt[0] = 0
i = 1和0,1比较大小 opt[1] = 1
i = 2和0,1比较大小 opt[2] = 2
i = 3和0,1比较大小 opt[3] = 3
i = 4和0,1, 2比较大小 opt[4] = 1
…
opt[n]会用到n之前的信息