完美世界4-8 Java面试题目

算法参考 全A

第一题Dijkstra，第二题暴力递归。

前面的题呢，难吗？

我也给两个全A参考。 第一题: public static void main(String[] args) { Scanner in = new Scanner(System.in); long[][] cityAndDis = new long[6][6]; for (int i = 0; i < 6; i++) { for (int j = 0; j < 6; j++) { int x = in.nextInt(); if (x == -1) cityAndDis[i][j] = Integer.MAX_VALUE; else cityAndDis[i][j] = x; } } int start = 0; long[] ans = Dijkstra(cityAndDis, start); for (int i = 1; i < 6; i++) { System.out.println(ans[i]); } } private static long[] Dijkstra(long[][] cityAndDis, int start) { long[] city = new long[cityAndDis.length]; long[] ans = new long[cityAndDis.length]; city[start] = 1; ans[start] = 0; for (int i = 1; i < cityAndDis.length; i++) { long min = Long.MAX_VALUE; int k = 0; for (int j = 0; j < cityAndDis.length; j++) { if (city[j] == 0 && cityAndDis[start][j] < min) { k = j; min = cityAndDis[start][j]; } } city[k] = 1; ans[k] = min; for (int j = 0; j < cityAndDis.length; j++) { if (city[j] == 0 && cityAndDis[k][j] + cityAndDis[start][k] < cityAndDis[start][j]) { cityAndDis[start][j] = cityAndDis[k][j] + cityAndDis[start][k]; } } } return ans; }

第二题:public static void main(String[] args) { Scanner in = new Scanner(System.in); int goodsNum = in.nextInt(); int bag = in.nextInt(); int[] goodsWei = new int[goodsNum]; int[] goodsVal = new int[goodsNum]; for (int i = 0; i < goodsNum; i++) { goodsWei[i] = in.nextInt(); } for (int i = 0; i < goodsNum; i++) { goodsVal[i] = in.nextInt(); } System.out.println(findMaxVal(goodsWei, goodsVal, 0, bag)); } private static int findMaxVal(int[] goodsWei, int[] goodsVal, int index, int bag) { if (bag < 0) { return -1; } if (index >= goodsVal.length) { return 0; } int v1 = findMaxVal(goodsWei, goodsVal, index + 1, bag); int v2 = findMaxVal(goodsWei, goodsVal, index + 1, bag - goodsWei[index]); int v3 = 0; if (v2 != -1) { v3 = goodsVal[index] + v2; } return Math.max(v1, v3); }

这是实习还是校招？

有收到面试通知吗

楼主收到面试通知了吗？面试的时候有没有问代码题啊🤣