奇数判断

public class LeetCode03 {
    public static double findMedianSortedArrays(int[] nums1, int[] nums2) {
        int size = nums1.length + nums2.length;
        List<Integer> list = new ArrayList<>(size);
        for(int i=0; i < nums1.length; i++){
            list.add(nums1[i]);
        }
        for(int i=0; i < nums2.length; i++) {
            list.add(nums2[i]);
        }
        Collections.sort(list);
        if(((list.size())&1) != 0){ // 是奇数
            int var = list.size()/2;
            return list.get(var);
        }else { // 是偶数
            int var1 = list.size()/2-1;
            int var2 = list.size()/2;
            return (list.get(var1) + list.get(var2)) / 2.0;
        }
    }

    public static void main(String ...args) {
        int[] nums1 = {1,2};
        int[] nums2 = {3,4};
        double d1 = findMedianSortedArrays(nums1, nums2);
        System.out.println(d1);
    }
}