有两个已经排好序的数组,A:{9,28,38,40,56,65,78,82} B:{13,21,33,38,45},请定义一个新数组,将这两个数组中的数据合并到新数组中并且保证数据仍然是有序的

package com.xintouyun.shuzu.test;
import java.util.*;
public class ShuzuTest1 {
	public static void main(String[] args){
	int[] arrA={9,28,38,40,56,65,78,82};
	int[] arrB={13,21,33,38,45};
	int[] arrboth=GetArrConcat(arrA,arrB);
	System.out.print("数组排序前:[");
	for(int i=0;i<arrboth.length;i++){
		System.out.print(arrboth[i]+" ");
	}
		System.out.println("]");
		int[] arrpx=Getbubblesort(arrboth);
		System.out.print("数组排序后:[");
		for(int a=0;a<arrpx.length;a++){
			System.out.print(arrpx[a]+" ");
		}
			System.out.print("]");
		}
	public static int[] GetArrConcat(int[] x, int[] y ) {  
	int[] ArrConcat = Arrays.copyOf(x, x.length + y.length);  
	System.arraycopy(y, 0, ArrConcat, x.length, y.length);  
	return ArrConcat;  
	}
	public static int[] Getbubblesort(int[] z){
		for(int i=0;i<z.length-1;i++){                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        
			for(int j=0;j<z.length-i-1;j++){
				if(z[j]>z[j+1]){
					int num=z[j];
					z[j]=z[j+1];
					z[j+1]=num;
				}		
			}
		}
		return z;	
	}
}
		
	  

package com.xintouyun.shuzu.test;
import java.util.*;
public class ShuzuTest1 {
    public static void main(String[] args){
    int[] arrA={9,28,38,40,56,65,78,82};
    int[] arrB={13,21,33,38,45};
    int[] arrboth=GetArrConcat(arrA,arrB);
    System.out.print("数组排序前:[");
    for(int i=0;i<arrboth.length;i++){
        System.out.print(arrboth[i]+" ");
    }
        System.out.println("]");
        int[] arrpx=Getbubblesort(arrboth);
        System.out.print("数组排序后:[");
        for(int a=0;a<arrpx.length;a++){
            System.out.print(arrpx[a]+" ");
        }
            System.out.print("]");
        }
    public static int[] GetArrConcat(int[] x, int[] y ) {  
    int[] ArrConcat = Arrays.copyOf(x, x.length + y.length);  
    System.arraycopy(y, 0, ArrConcat, x.length, y.length);  
    return ArrConcat;  
    }
    public static int[] Getbubblesort(int[] z){
        for(int i=0;i<z.length-1;i++){                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        
            for(int j=0;j<z.length-i-1;j++){
                if(z[j]>z[j+1]){
                    int num=z[j];
                    z[j]=z[j+1];
                    z[j+1]=num;
                }        
            }
        }
        return z;    
    }
}
        
      

运行结果为:

猜你喜欢

转载自blog.csdn.net/qq_40180411/article/details/81149227