Leetcode 2170. 使数组变成交替数组的最少操作数

// https://leetcode-cn.com/problems/minimum-operations-to-make-the-array-alternating/
public int minimumOperations(int[] nums) {
        int res = 0;
        Map<Integer, Integer> jmap = new HashMap<>();
        Map<Integer, Integer> omap = new HashMap<>();
        for(int i = 0; i < nums.length; i = i+2){
            if(!omap.containsKey(nums[i])) omap.put(nums[i],1);
            else omap.put(nums[i], omap.get(nums[i])+1);
            if(i+1 < nums.length) {
                jmap.put(nums[i+1], jmap.getOrDefault(nums[i+1],0)+1);
            }
        }
        int o0 = 0, o1 = 0;
        int j0 = 0, j1 = 0;
        int onum = 0, jnum = 0;
        for(int i : omap.keySet()){
            if(omap.get(i) > omap.getOrDefault(o0,0)) {
                o1 = o0;
                o0 = i;
            }
            else if(omap.get(i) > omap.getOrDefault(o1,0)) o1 = i;
        }
        for(int i : jmap.keySet()){
            if(jmap.get(i) > jmap.getOrDefault(j0,0)) {
                j1 = j0;
                j0 = i;
            }
            else if(jmap.get(i) > jmap.getOrDefault(j1,0)) j1 = i;
        }
        onum = o0;
        jnum = j0;
        if(o0==j0){
            if(omap.get(o0)+jmap.getOrDefault(j1,0) >= omap.getOrDefault(o1,0)+jmap.get(j0)){
                jnum = j1;
            }else{
                onum = o1;
                jnum = j0;
            }
        }
        res += (nums.length - omap.getOrDefault(onum,0) - jmap.getOrDefault(jnum,0));
        return res;
    }