public int[] finalPrices(int[] prices) {
int n=prices.length;
int[] ans=new int[n];
Arrays.fill(ans,-1);
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
if(prices[j]<=prices[i]){
ans[i]=prices[i]-prices[j];
break;
}
}
if(ans[i]==-1) ans[i]=prices[i];
}
return ans;
}
2022.9.1-----leetcode.1475
最新推荐文章于 2024-07-25 21:13:04 发布