distribute candies

最新推荐文章于 2021-11-01 01:49:47 发布

原创最新推荐文章于 2021-11-01 01:49:47 发布 · 293 阅读

CC 4.0 BY-SA版权

解决一个整数数组中的糖果分配问题，确保兄妹两人能平分不同种类的糖果，目标是最大化妹妹能够获得的不同种类糖果的数量。

Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute these candies equally in number to brother and sister. Return the maximum number of kinds of candies the sister could gain.

Example 1:

Input: candies = [1,1,2,2,3,3]
Output: 3
Explanation:
There are three different kinds of candies (1, 2 and 3), and two candies for each kind.
Optimal distribution: The sister has candies [1,2,3] and the brother has candies [1,2,3], too. 
The sister has three different kinds of candies.

Example 2:

Input: candies = [1,1,2,3]
Output: 2
Explanation: For example, the sister has candies [2,3] and the brother has candies [1,1]. 
The sister has two different kinds of candies, the brother has only one kind of candies.

Note:

The length of the given array is in range [2, 10,000], and will be even.
The number in given array is in range [-100,000, 100,000].

尝试：

class Solution {
public:
    int distributeCandies(vector<int>& candies) {
                    vector<int> num;
                 for(i=0;i<num.size();i++)
                 {
                      if (num[i])
                 }


    }
};

显然不对，不需要重新定义。

修改：

class Solution {
    
public:
    int distributeCandies(vector<int>& candies) {
                    int num=0;
               sort(candies.begin(),candies.end());
          for (int i=0;i<candies.size();i++)
                 {
                      if (candies[i]!=candies[i+1])
                          num+=1;
                 }
                   if(candies.size()/2.0<=num)
                   { 
                     
                       return  candies.size()/2.0;
                   }
                    
                      else 
                      {
                          return num;   
                    }
               }
           };

报错，从o开始到最后一个不对啊！（i+1）

class Solution {
    
public:
    int distributeCandies(vector<int>& candies) {
                    int num=1;
               sort(candies.begin(),candies.end());
          for (int i=0;i<candies.size()-1;i++)
                 {
                      if (candies[i]!=candies[i+1])
                          num+=1;
                 }
                   if(candies.size()/2.0<=num)
                   { 
                     
                       return  candies.size()/2.0;
                   }
                    
                      else 
                      {
                          return num;   
                    }
               }
           };