题目链接 https://leetcode-cn.com/problems/final-prices-with-a-special-discount-in-a-shop/ 解题思路 暴力法对于每个price[i],从i + 1~~~len做循环,寻找第一个适合的price[j],如果找到就减去折扣并立即跳出循环 AC代码 class Solution { public int[] finalPrices(int[] prices) { int len = prices.length; for (int i = 0; i < len; i++) { for (int j = i + 1; j < len; j++) { if (prices[j] <= prices[i]) { prices[i] -= prices[j]; break; } } } return prices; } } 本地测试代码 package com.company; import java.util.Arrays; public class Solution_1475 { public static int[] finalPrices(int[] prices) { int len = prices.length; for (int i = 0; i < len; i++) { for (int j = i + 1; j < len; j++) { if (prices[j] <= prices[i]) { prices[i] -= prices[j]; break; } } } return prices; } public static void main(String[] args) { System.out.println(Arrays.toString(finalPrices(new int[]{8, 4, 6, 2, 3}))); System.out.println(Arrays.toString(finalPrices(new int[]{1, 2, 3, 4, 5}))); System.out.println(Arrays.toString(finalPrices(new int[]{10, 1, 1, 6}))); } }