参考代码:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[] arr = new int[10];
for (int i = 0; i < 10; i++) {
int n = scanner.nextInt();
if (n >= 0 && n <= 30000) {
arr[i] = n;
}
}
int[] result = mSort(arr);
for (int i = 0; i < arr.length; i++) {
System.out.print(result[i] + " ");
}
}
private static int[] mSort(int[] arr) {
int start = 0;
int end = arr.length - 1;
int x = arr[0];
while (end > start) {
while (arr[end] % 2 == 0 && end > start) {
end--;
}
if (end > start) {
arr[start] = arr[end];
start++;
}
while (arr[start] % 2 != 0 && end > start) {
start++;
}
if (end > start) {
arr[end] = arr[start];
end--;
}
}
arr[start] = x;
if (x % 2 != 0) {
end++;
}
int[] startArr = new int[end];
int[] endArr = new int[arr.length - end];
for (int i = 0; i < startArr.length; i++) {
startArr[i] = arr[i];
}
outBubble(startArr);
for (int i = 0; i < endArr.length; i++) {
endArr[i] = arr[end + i];
}
inBubble(endArr);
return addArray(startArr, endArr);
}
public static void inBubble(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
public static void outBubble(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if (arr[j] < arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
public static int[] addArray(int[] arr1, int[] arr2) {
int[] nArr = new int[arr1.length + arr2.length];
System.arraycopy(arr1, 0, nArr, 0, arr1.length);
System.arraycopy(arr2, 0, nArr, arr1.length, arr2.length);
return nArr;
}
}
0.0分
3 人评分
C语言程序设计教程(第三版)课后习题7.4 (Java代码)浏览:839 |
【偶数求和】 (C语言代码)浏览:640 |
WU-输出九九乘法表 (C++代码)浏览:1665 |
C语言程序设计教程(第三版)课后习题1.5 (C语言代码)浏览:529 |
Hello, world! (C++代码)浏览:1744 |
DNA (C语言代码)浏览:540 |
矩形面积交 (C++代码)浏览:1127 |
1118(求助_已解决)浏览:329 |
剪刀石头布 (C++代码)浏览:1706 |
1050题解(结构体数组与结构体指针的使用)浏览:1107 |