本文共 1680 字，大约阅读时间需要 5 分钟。

题目要求

思路：

实现：

import java.util.Arrays;public class Johnson {    public static void main(String[] args) {        int[] a = {3, 4, 8, 10};        int[] b = {6, 2, 9, 15};        int sum = flowShop(a, b);        System.out.println(sum);    }    public static int flowShop(int[] a, int[] b) {        int[] order = new int[a.length];        Work[] works = new Work[a.length];        for (int i = 0; i < a.length; i++) {            int key = a[i] > b[i] ? b[i] : a[i];            boolean job = a[i] <= b[i];            works[i] = new Work(key, i, job);        }        Arrays.sort(works);        int j = 0;        int k = a.length - 1;        for (int i = 0; i < a.length; i++) {            if (works[i].job) order[j++] = works[i].index;            else order[k--] = works[i].index;        }        //将第一类任务按照升序排列，第二类任务按降序排列        // 后者接在前者之后        j = a[order[0]];        k = j + b[order[0]];        for (int i = 1; i < a.length; i++) {//到第 i 个任务的时候是第一台机器先干完还是第二台先干完            j += a[order[i]];            k = j < k ? k + b[order[i]] : j + b[order[i]];        }        return k;    }}class Work implements Comparable
   
     {    int key;int index;boolean job;    public Work(int key, int index, boolean job) {        this.key = key;        this.index = index;        this.job = job;    }    @Override    public int compareTo(Work o) {        return key - o.key;    }}
   

转载地址：https://blog.csdn.net/qq_43313769/article/details/100191763 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！