有两种思路,一个是代码体比较简单,但时间复杂度较大,另一种待补充...
1.使用两层循环解决问题,代码如下:
import java.util.Date;
/**
* Created with IntelliJ IDEA.
* Description:
* User: Y
* Date: 2019-07-01
* Time: 22:19
*/
public class AntiOrder {
public static int count(int[] array, int n) {
int tmp = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (array[i] > array[j]) {
tmp++;
}
}
}
return tmp;
}
public static void main(String[] args) {
int[] q = {1, 2, 3, 4, 5, 6, 7, 0};
System.out.println(count(q, 8));
}
}