4. 寻找两个正序数组的中位数

class Solution {
    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
        ArrayList<Integer> list = new ArrayList<>();
        for (int i = 0; i < nums1.length; i++) {
            list.add(nums1[i]);
        }
        for (int i = 0; i < nums2.length; i++) {
            list.add(nums2[i]);
        }
        double num = 0;
        Collections.sort(list);
        if (list.size() % 2 == 0){
            num = (list.get(list.size() / 2) + list.get(list.size() / 2 - 1)) / 2.0;
        }else {
            num = list.get(list.size()/2);
        }
        return num;
    }
}