华为OD机试真题 - 转盘寿司
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[] price = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
int[] newPrice = getLastPrice(price);
for (int i = 0; i < newPrice.length; i++) {
System.out.print(newPrice[i] + " ");
}
}
public static int[] getLastPrice(int[] price) {
int[] newPrice = new int[price.length];
for (int i = 0; i < price.length; i++) {
if (i + 1 < price.length && price[i + 1] < price[i])
newPrice[i] = price[i] + price[i + 1];
else
newPrice[i] = price[i];
}
if (newPrice[price.length - 1] > price[0])
newPrice[price.length - 1] += price[0];
return newPrice;
}
Scanner scanner = new Scanner(System.in);
int[] price = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
int[] newPrice = getLastPrice(price);
for (int i = 0; i < newPrice.length; i++) {
System.out.print(newPrice[i] + " ");
}
}
public static int[] getLastPrice(int[] price) {
int[] newPrice = new int[price.length];
for (int i = 0; i < price.length; i++) {
if (i + 1 < price.length && price[i + 1] < price[i])
newPrice[i] = price[i] + price[i + 1];
else
newPrice[i] = price[i];
}
if (newPrice[price.length - 1] > price[0])
newPrice[price.length - 1] += price[0];
return newPrice;
}
全部评论
相关推荐
点赞 评论 收藏
分享