牛客网编程巅峰挑战赛青铜白银黄金组第3场 哎,就只会做一题,我好菜啊!第一题: public class Solution { public int Minimumdays (int n, int[] DEF) { // write code here Arrays.sort(DEF); int currDay = 0; for(int i = 0; i < n; ++i){ if(currDay >= DEF[i]){ currDay++; }else{ currDay = DEF[i] + 1; } } return currDay - 1; } }第二题:快速幂 public...