代码拉取完成,页面将自动刷新
同步操作将从 doocs/leetcode 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
You are given two 0-indexed integer arrays jobs
and workers
of equal length, where jobs[i]
is the amount of time needed to complete the ith
job, and workers[j]
is the amount of time the jth
worker can work each day.
Each job should be assigned to exactly one worker, such that each worker completes exactly one job.
Return the minimum number of days needed to complete all the jobs after assignment.
Example 1:
Input: jobs = [5,2,4], workers = [1,7,5] Output: 2 Explanation: - Assign the 2nd worker to the 0th job. It takes them 1 day to finish the job. - Assign the 0th worker to the 1st job. It takes them 2 days to finish the job. - Assign the 1st worker to the 2nd job. It takes them 1 day to finish the job. It takes 2 days for all the jobs to be completed, so return 2. It can be proven that 2 days is the minimum number of days needed.
Example 2:
Input: jobs = [3,18,15,9], workers = [6,5,1,3] Output: 3 Explanation: - Assign the 2nd worker to the 0th job. It takes them 3 days to finish the job. - Assign the 0th worker to the 1st job. It takes them 3 days to finish the job. - Assign the 1st worker to the 2nd job. It takes them 3 days to finish the job. - Assign the 3rd worker to the 3rd job. It takes them 3 days to finish the job. It takes 3 days for all the jobs to be completed, so return 3. It can be proven that 3 days is the minimum number of days needed.
Constraints:
n == jobs.length == workers.length
1 <= n <= 105
1 <= jobs[i], workers[i] <= 105
class Solution:
def minimumTime(self, jobs: List[int], workers: List[int]) -> int:
jobs.sort()
workers.sort()
return max((a + b - 1) // b for a, b in zip(jobs, workers))
class Solution {
public int minimumTime(int[] jobs, int[] workers) {
Arrays.sort(jobs);
Arrays.sort(workers);
int ans = 0;
for (int i = 0; i < jobs.length; ++i) {
ans = Math.max(ans, (jobs[i] + workers[i] - 1) / workers[i]);
}
return ans;
}
}
class Solution {
public:
int minimumTime(vector<int>& jobs, vector<int>& workers) {
sort(jobs.begin(), jobs.end());
sort(workers.begin(), workers.end());
int ans = 0;
for (int i = 0; i < jobs.size(); ++i) ans = max(ans, (jobs[i] + workers[i] - 1) / workers[i]);
return ans;
}
};
func minimumTime(jobs []int, workers []int) int {
sort.Ints(jobs)
sort.Ints(workers)
ans := 0
for i, a := range jobs {
b := workers[i]
ans = max(ans, (a+b-1)/b)
}
return ans
}
func max(a, b int) int {
if a > b {
return a
}
return b
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。