Python | Leetcode Python题解之第458题可怜的小猪
题目:
题解:
class Solution:
def poorPigs(self, buckets: int, minutesToDie: int, minutesToTest: int) -> int:
if buckets == 1:
return 0
combinations = [[0] * (buckets + 1) for _ in range(buckets + 1)]
combinations[0][0] = 1
iterations = minutesToTest // minutesToDie
f = [[1] * (iterations + 1)] + [[1] + [0] * iterations for _ in range(buckets - 1)]
for i in range(1, buckets):
combinations[i][0] = 1
for j in range(1, i):
combinations[i][j] = combinations[i - 1][j - 1] + combinations[i - 1][j]
combinations[i][i] = 1
for j in range(1, iterations + 1):
for k in range(i + 1):
f[i][j] += f[k][j - 1] * combinations[i][i - k]
if f[i][iterations] >= buckets:
return i
return 0
原文地址:https://blog.csdn.net/Mopes__/article/details/142721880
免责声明:本站文章内容转载自网络资源,如本站内容侵犯了原著者的合法权益,可联系本站删除。更多内容请关注自学内容网(zxcms.com)!