color socks problem

链接

题目：

思路：数学问题

Find at least how many socks to make a pair,That is, one sock of each color,再加1只 Can make up a pair！
如：2 2 1 ,则只需要3+1=4Can only make up a pair;

But if there is only one sock of each color or0只,No amount of color socks can make up a pair！
如：1 1 1 0 1 ,Can't get it together,返回-1;

所以,At least one sock color is larger than1只 ！
使用singleThe variable record is greater than1the number of socks,如果single=0,ie all color socks are≤ 1,Can't make a pair,返回-1;

注意： 输入数据有多组,使用外层for循环,遍历输入;

import java.util.Scanner;
public class Main{
    
    public static void main(String[] args){
    
        Scanner in=new Scanner(System.in);
        int T=in.nextInt();
        for(int t=0;t<T;t++){
     // Iterate over different test data
                // 数组长度
            int n=in.nextInt();
            int[] color=new int[n];
            int single=0;
            int num=0;
            for(int i=0;i<n;i++){
    
                int temp=in.nextInt();
                color[i]=temp;
                // Take one for each colornum
                // Singular numbers are not includednum
                if(color[i]>1){
    
                    single++;
                    num++;
                }else if(color[i]==1){
     // 
                    num++;
                }
            }
            if(single==0){
     // That is, each color is an OR0 只,You can't get a pair 
                System.out.println(-1);
            }else{
    
                System.out.println(num+1);
            }    
        }
    }
}