Commit 3e4893b

authored

Update 1723.find-minimum-time-to-finish-all-jobs.md

1 parent 28629f3 commit 3e4893bCopy full SHA for 3e4893b

File tree

-0

lines changed

-0

lines changed

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -84,11 +84,13 @@ class Solution:`
`84`	`84`	`workloads[i] += jobs[pos]`
`85`	`85`	`if backtrack(pos + 1, workloads, limit): return True`
`86`	`86`	`workloads[i] -= jobs[pos]`
	`87`	`+ # 剪枝`
`87`	`88`	`if workload == 0:`
`88`	`89`	`return False`
`89`	`90`	`return False`
`90`	`91`	`def possible(limit):`
`91`	`92`	`return backtrack(0, [0] * k, limit)`
	`93`	`+ # 剪枝`
`92`	`94`	`jobs.sort(reverse=True)`
`93`	`95`	`l, r = jobs[0], sum(jobs)`
`94`	`96`	`while l <= r:`

Comments

(0)