20210406森林里的兔子

森林中，每个兔子都有颜色。其中一些兔子（可能是全部）告诉你还有多少其他的兔子和自己有相同的颜色。我们将这些回答放在 answers 数组里。

返回森林中兔子的最少数量。

示例:

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/rabbits-in-forest
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

示例:
输入: answers = [1, 1, 2]
输出: 5
解释:
两只回答了 “1” 的兔子可能有相同的颜色，设为红色。
之后回答了 “2” 的兔子不会是红色，否则他们的回答会相互矛盾。
设回答了 “2” 的兔子为蓝色。
此外，森林中还应有另外 2 只蓝色兔子的回答没有包含在数组中。
因此森林中兔子的最少数量是 5: 3 只回答的和 2 只没有回答的。

输入: answers = [10, 10, 10]
输出: 11

输入: answers = []
输出: 0

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/rabbits-in-forest
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

package com.leecode.demo;

import java.util.Arrays;

public class CountRabbit {
	public static int numRabbits(int[] answers) {
        if(answers.length == 0){
            return 0;
        }else{
            //怎么分析数据？？
            //清除数据
        	int counter =0;
        	int i = 0,j = 0;
        	for(i =0;i < answers.length -1;i++) {
        		//System.out.println("i="+i+";j="+j);
        		if(answers[i] == 0) {
        			counter++;
        			answers[i]=-2;
        			System.out.println("answers[i]==0");
        		}else if(answers[i]!=-2) {
        			
        			
        			int p = 0;
        			
        			
            		for(j= i+1;j<answers.length;j++) {
            			//System.out.println("i="+i+";j="+j);
            			if(answers[j]==0) {
            				counter++;
            				System.out.println("answers[j]==0");
            				answers[j]=-2;
            			}
            			if(answers[i] == answers[j]&&answers[i]!=0&&answers[i]!=-2) {
            				answers[j]= -2;
            				//-2作为靶标，标记
            				p++;
            			}
            		}
            		if(p== answers[i]) {
            			counter = counter + answers[i]+1;
            			System.out.println("answers[i]="+answers[i]+"  sum="+ (answers[i]+1));
            		}else if(p==0){
            			System.out.println("counter="+counter);
            			counter = counter + answers[i]+1;
            			System.out.println("counter="+counter);
            			System.out.println("answers[i]="+answers[i]+"  sum="+ (answers[i]+1));
            		}else if(p < answers[i]) {
            			counter = counter +  answers[i] +1;
            		}else if(p > answers[i]) {
            			if((p +1)%( answers[i]+1)==0&&answers[i]!=1) {
            				counter = counter + ((p+1)/answers[i])*answers[i];
            				System.out.println("answers[i]="+answers[i]+"  sum="+((p+1)/answers[i])*answers[i]);
            			}else if((p +1)% (answers[i]+1)!=0&&answers[i]!=1) {
            				counter = counter + (((p+1)/(answers[i]+1))*(answers[i]+1) + answers[i] + 1);
            				System.out.println("3answers[i]="+answers[i]+"  sum="+ (((p+1)/answers[i])*answers[i] + answers[i] + 1)+((p+1)/(answers[i]+1)));
            			}else if((p +1)% 2==0&&answers[i]==1) {
            				counter = counter + p+1;
            				System.out.println("answers[i]="+answers[i]+"  sum="+ (p+1));
            			}else if((p +1)% 2!=0&&answers[i]==1) {
            				counter = counter + (p+1)/2*2 +2;
            				System.out.println("answers[i]="+answers[i]+"  sum="+ (p+3));
            			}
            		}
            		p=0;
        		}

 
        	}
        	if(answers[answers.length-1]!=-2) {
    			counter = counter +  answers[answers.length-1] +1;
    			//System.out.println("counter="+counter);
    		}
            System.out.println(Arrays.toString(answers));
            return counter;

        }

    }
	
	public static void main(String[] args) {
		int[] nums = {0,0,2,2,4,3,4,1,0,1,0,1,4,2,1,1,4,0,2,4};//
		//[2,2,0,0,2]
		//[1,0,1,0,0]  5
		//[0,0,1,1,1]  6
		//[0,2,0,2,1]  7
		//[0,3,2,0,3,3,4,2,4,3,2,4,4,3,0,1,3,4,4,3]  26
		//[0,0,0,1,0] 6

		//[0,0,2,2,4,3,4,1,0,1,0,1,4,2,1,1,4,0,2,4]  26
		int i = numRabbits(nums);
		System.out.println(i);
	}
}