Java 交换数组中的奇数和偶数
我在这个网站上看到了这个代码。它使用一种方法对数组进行排序,数组的前面是偶数,后面是奇数。我想知道你是否可以做同样的事情,除了先显示奇数,然后再显示偶数?我试过了,但没用。我不熟悉java编码,我想测试递归Java 交换数组中的奇数和偶数,java,recursion,Java,Recursion,我在这个网站上看到了这个代码。它使用一种方法对数组进行排序,数组的前面是偶数,后面是奇数。我想知道你是否可以做同样的事情,除了先显示奇数,然后再显示偶数?我试过了,但没用。我不熟悉java编码,我想测试递归 public class Recurse { //i=left //j=right //first i tried to shift the whole thing //have all even numbers pop to the front of array when even p
public class Recurse {
//i=left
//j=right
//first i tried to shift the whole thing
//have all even numbers pop to the front of array when even
public static int[] seperator(int[] arr1, int left, int right){
int temp;
if(left>=right) //base case, return array
return arr1;
else if(arr1[left]%2!=0 && arr1[right]%2==0){//if match, do the swap
temp=arr1[left];
arr1[left]=arr1[right];
arr1[right]=temp;
return seperator(arr1, left+1, right-1);
}
else{
if(arr1[right]%2!=0){//if right side is on odd #, then decrease index
return seperator(arr1, left, right-1);
}
if(arr1[left]%2==0){//if left side is on even #, then increase index
return seperator(arr1, left+1, right);
}
}
return arr1;
}
public static void main(String[] args){
//int index=0;
int[] arry={70,13,48,19,24,5,7,10};
int[] newarry=seperator(arry, 0, arry.length-1);
System.out.print("The new sorted array is: ");
for(int i=0; i<newarry.length;i++){
System.out.print(newarry[i]+" ");
}
}
好吧,如果您想让奇数排在第一位,请替换任何
%2=0
与%2==0
和任何%2==0
与%2=0
:
public static int[] seperator(int[] arr1, int left, int right){
int temp;
if(left>=right)
return arr1;
else if(arr1[left]%2==0 && arr1[right]%2!=0){
temp=arr1[left];
arr1[left]=arr1[right];
arr1[right]=temp;
return seperator(arr1, left+1, right-1);
}
else{
if(arr1[right]%2==0){//if right side is on even #, then decrease index
return seperator(arr1, left, right-1);
}
if(arr1[left]%2!=0){//if left side is on odd #, then increase index
return seperator(arr1, left+1, right);
}
}
return arr1;
}
尝试以下方法:
public static int[] seperator(int[] arr1, int left, int right) {
int temp;
if (left >= right) // base case, return array
return arr1;
else if (arr1[left] % 2 == 0 && arr1[right] % 2 != 0) {// if match, do the swap
temp = arr1[left];
arr1[left] = arr1[right];
arr1[right] = temp;
return seperator(arr1, left + 1, right - 1);
} else {
if (arr1[right] % 2 == 0) {// if right side is on odd #, then decrease index
return seperator(arr1, left, right - 1);
}
if (arr1[left] % 2 != 0) {// if left side is on even #, then increase index
return seperator(arr1, left + 1, right);
}
}
return arr1;
}
Output:
The new sorted array is: 7 13 5 19 24 48 70 10
公共类程序{
公共静态void main(字符串[]args){
INTA[]={2,3,5,6,7,8,10,46,50};
对于(int i=0;i
谢谢!这有助于:)如果没有理由隐藏它,那么披露你在哪个网站看到它将是一种良好的行为
public static int[] seperator(int[] arr1, int left, int right) {
int temp;
if (left >= right) // base case, return array
return arr1;
else if (arr1[left] % 2 == 0 && arr1[right] % 2 != 0) {// if match, do the swap
temp = arr1[left];
arr1[left] = arr1[right];
arr1[right] = temp;
return seperator(arr1, left + 1, right - 1);
} else {
if (arr1[right] % 2 == 0) {// if right side is on odd #, then decrease index
return seperator(arr1, left, right - 1);
}
if (arr1[left] % 2 != 0) {// if left side is on even #, then increase index
return seperator(arr1, left + 1, right);
}
}
return arr1;
}
Output:
The new sorted array is: 7 13 5 19 24 48 70 10
public class Program {
public static void main(String[] args) {
int a[] = { 2, 3, 5, 6, 7, 8, 10, 46, 50 };
for (int i = 0; i < a.length - 1; i++) {
for (int j = 0 ; j < a.length-1; j++) {
if (a[j] % 2 != 0) {
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i] + " ");
}
}
}