import java.util.*; // 第一题,用迪杰斯特拉算法即可解出 public class Solution { public int getMinimumTime (int[] productList, int[][] drivingTimes) { Arrays.sort(productList); int[] dist = dijkstra(drivingTimes,0); int time = dist[dist.length-1]; int res = 0; int prev =...