第一种方法:
public static void main(String[] args) {
int[] arr = method(10);//赋值调用
System.out.println();
System.out.println("排序后的数组为:");//遍历排好序的数组
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + "\t");//输出
}
}
public static int[] method(int length) {
int[] oldArr = new int[length];
Random r = new Random();
for (int i = 0; i < oldArr.length; i++) {
oldArr[i] = r.nextInt(10, 21);
}
System.out.println("原数组为:");
for (int i = 0; i < oldArr.length; i++) {
System.out.print(oldArr[i] + "\t");
}
int[] newArr = new int[length];//创建一个新数组,用来装排好的元素
int left = 0;//定义左边的索引
int right = length - 1;//定义右边的索引
for (int i = 0; i < oldArr.length; i++) {
if (oldArr[i] % 2 == 1) {//判断左边的元素是否为奇数
newArr[left] = oldArr[i];//如果是奇数,赋值给新数组
left++;//赋值后,索引向右移动,继续判断
} else {
newArr[right] = oldArr[i];//如果左边是偶数,赋值给新数组右边
right--;//赋值后,右边索引向左移动
}
}
return newArr;//返回排好序的新数组
}
第二种方法:
public static void main(String[] args) {
int[] arr={11, 76, 33, 44, 55, 33, 77, 88};
method(arr);
}
public static void method(int[] arr){
int left=0;
int right=arr.length-1;
while (left<right){
while (arr[left]%2!=0&&left<=right){
left++;
}
while (arr[right]%2==0&&right>left){
right--;
}
int temp=arr[left];
arr[left]=arr[right];
arr[right]=temp;
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]+" ");
}
}