题解 | #手套#

import java.util.*;

public class Gloves {
    public int findMinimum(int n, int[] left, int[] right) {
        // write code here
        //左右手手套个数
        int leftSum =0;
        int rightSum=0;
        int leftMin =Integer.MAX_VALUE;
        int rightMin=Integer.MAX_VALUE;
        int sum=0;
        for(int i=0;i<n;i++){
            if(left[i]*right[i]==0){
                sum+=left[i]+right[i];
            }else{
                leftSum +=left[i];
                rightSum +=right[i]; 

            
            //求最小
            if(rightMin>right[i]){
                rightMin = right[i];
            }
            if(leftMin>left[i]){
                leftMin=left[i];
            }
            }
        }
        return Math.min(leftSum-leftMin+1,rightSum-rightMin+1)+sum+1;
    }
}