目录
题目
解题思路
1、目前只会暴力法
import java.util.LinkedList;
import java.util.Scanner;
public class Stock {
public static void main(String[] args) {
int[] price = {23,24,25,21,12,22,31,23};
int n = price.length;
LinkedList<Integer> res = new LinkedList<>();
for (int i = 0; i < n; i++) {
boolean found = false;
for (int j = i+1 ; j < n; j++) {
if (price[j] > price[i]) {
res.add(i, j-i);
found = true;
break;
}
}
if (!found) {
res.add(i,0);
}
}
for (Integer integer : res) {
System.out.println(integer);
}
}
}