数组奇偶排序
题目描述
给一个数组进行奇偶排序,奇数在前,偶数在后,原奇数,偶数之间的相对位置不能发生变化O(1)的空间复杂度实现
思路
使用插入排序的思想,左侧维护一个奇数区, l e f t left left变量指向奇数区的右边界(包括右边界)
代码实现
private static void oddEvenSort(int[] nums) {
int n = nums.length;
// 奇数区右边界 (包括)
int left = -1;
int i = 0;
while (i < n) {
if (nums[i] % 2 == 0) {
i++;
} else {
int p = nums[i];
for (int j = i - 1; j > left; j--) {
nums[j + 1] = nums[j];
}
// 奇数区扩大
nums[++left] = p;
i++;
}
}
}
由于没有找到合适的oj
平台,可以测试这道题,所以使用对数器
测试自己写的代码。
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
int testTime = 500;
int maxSize = 100;
int maxValue = 100;
boolean succeed = true;
for (int i = 0; i < testTime; i++) {
int[] arr1 = generateRandomArray(maxSize, maxValue);
int[] arr2 = copyArray(arr1);
oddEvenSort(arr1);
comparator(arr2);
if (!isEqual(arr1, arr2)) {
succeed = false;
System.out.println("i = " + i);
printArray(arr2);
break;
}
}
System.out.println(succeed ? "Nice!" : "Fucking fucked!");
}
private static void oddEvenSort(int[] nums) {
int n = nums.length;
// 奇数区右边界 (包括)
int left = -1;
int i = 0;
while (i < n) {
if (nums[i] % 2 == 0) {
i++;
} else {
int p = nums[i];
for (int j = i - 1; j > left; j--) {
nums[j + 1] = nums[j];
}
// 奇数区扩大
nums[++left] = p;
i++;
}
}
}
private static void comparator(int[] nums) {
int n = nums.length;
int[] res = new int[n];
int idx = 0;
for (int i = 0; i < n; i++) {
if (nums[i] % 2 == 1) {
res[idx++] = nums[i];
}
}
for (int i = 0; i < n; i++) {
if (nums[i] % 2 == 0) {
res[idx++] = nums[i];
}
}
for (int i = 0; i < n; i++) {
nums[i] = res[i];
}
}
public static int[] generateRandomArray(int maxSize, int maxValue) {
int[] arr = new int[(int) ((maxSize + 1) * Math.random())];
for (int i = 0; i < arr.length; i++) {
arr[i] = (int) (Math.random() * maxValue) + 1;
}
return arr;
}
public static int[] copyArray(int[] arr) {
if (arr == null) {
return null;
}
int[] res = new int[arr.length];
for (int i = 0; i < arr.length; i++) {
res[i] = arr[i];
}
return res;
}
public static boolean isEqual(int[] arr1, int[] arr2) {
if ((arr1 == null && arr2 != null) || (arr1 != null && arr2 == null)) {
return false;
}
if (arr1 == null && arr2 == null) {
return true;
}
if (arr1.length != arr2.length) {
return false;
}
for (int i = 0; i < arr1.length; i++) {
if (arr1[i] != arr2[i]) {
return false;
}
}
return true;
}
public static void printArray(int[] arr) {
if (arr == null) {
return;
}
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
}
}
全文完。