力扣——寻找两个正序数组的中位数（java完整）

import java.util.*;
public class Array02 {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int num1[] = {5,4};
		int num2[] = {3,2};
		System.out.print(help(num1,num2));
		
	}
	public static double help(int []num1,int[]num2) {
		int m = num1.length;
		int n = num2.length;
		int []nums = new int[m+n];
		
		//给nums数组赋值，将两个数组合并
		for(int i = 0;i<num1.length;i++) {
			nums[i] = num1[i];
		}
		int ji = 0;
		for(int i = num1.length;i<nums.length;i++) {
					nums[i] = num2[ji];
					ji++;
		}
		
		//进行选择排序
		for(int i = 0;i<nums.length-1;i++) {
			int index = i;
			for(int j = i+1;j<nums.length;j++) {
				
				if(nums[j]<nums[index]) {
					index = j;
				}
			}
			int temp = nums[index];
			nums[index] = nums[i];
			nums[i] = temp;
		}
		
		double zhongw = 0;
		
		if(nums.length%2==0) {
			zhongw = (nums[nums.length/2]+nums[nums.length/2-1])/2.0;
		}
		else {
			zhongw = nums[(nums.length+1)/2-1];
		}
		
		return zhongw;
	}
}