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

Author: azl397985856

problems/1723.find-minimum-time-to-finish-all-jobs.md

@@ -84,11 +84,13 @@ class Solution:
                     workloads[i] += jobs[pos]
                     if backtrack(pos + 1, workloads, limit): return True
                     workloads[i] -= jobs[pos]
+                # 剪枝
                 if workload == 0:
                     return False
             return False
         def possible(limit):
             return backtrack(0, [0] * k, limit)
+        # 剪枝
         jobs.sort(reverse=True)
         l, r = jobs[0], sum(jobs)
         while l <= r: