public static void main(String[] args) {
int[] nums = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19}
System.out.print("原数组：")
for (int num : nums) {
System.out.print(num+" ")
}
System.out.print("\n倒序新数组：")
for (int num : reverseArray1(nums)) {
System.out.print(num + " ")
}
}
//1.排序后倒序
public static int[] reverseArray1(int[] nums) {
Arrays.sort(nums)
int[] reNums = new int[nums.length]
for (int i = 0i <nums.lengthi++) {
reNums[i] = nums[nums.length - 1 - i]
}
return reNums
}
//2.Collection 内置的逆序
public static int[] reverseArray2(int[] nums) {
ArrayList<Integer>list = new ArrayList<>()
for (int i = 0i <nums.lengthi++) {
list.add(nums[i])
}
Collections.reverse(list)
int [] reNums = new int[nums.length]
for (int i = 0i <nums.length i++) {
reNums[i] = list.get(i)
}
return reNums
}
public class SortNums {public static void main(String[] s){
List<Integer>list = new ArrayList<Integer>()
for(int i=1i<=100i++){
if(i%2==0){
list.add(i)
}
}
System.out.println(list)
Collections.sort(list,Collections.reverseOrder())
System.out.println(list)
}
}
好简单的，输出结果为：
[2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100]
[100, 98, 96, 94, 92, 90, 88, 86, 84, 82, 80, 78, 76, 74, 72, 70, 68, 66, 64, 62, 60, 58, 56, 54, 52, 50, 48, 46, 44, 42, 40, 38, 36, 34, 32, 30, 28, 26, 24, 22, 20, 18, 16, 14, 12, 10, 8, 6, 4, 2]
