distribute candies
来源:互联网 发布:http协议的端口号 编辑:程序博客网 时间:2024/06/10 15:47
Given an integer array with even length, where different numbers in this array represent differentkinds of candies. Each number means one candy of the corresponding kind. You need to distribute these candiesequally in number to brother and sister. Return the maximum number ofkinds of candies the sister could gain.
Example 1:
Input: candies = [1,1,2,2,3,3]Output: 3Explanation: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: 2Explanation: 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; } } };
阅读全文
0 0
- Distribute Candies
- Distribute Candies
- Distribute Candies
- distribute candies
- LeetCode575. Distribute Candies
- 575. Distribute Candies
- 575. Distribute Candies
- LeetCode | 575. Distribute Candies
- LeetCode之Distribute Candies
- 575. Distribute Candies
- 575. Distribute Candies
- leetcode 575. Distribute Candies
- 575. Distribute Candies
- [LeetCode]575. Distribute Candies
- LeetCode Distribute Candies
- [leetcode]: 575. Distribute Candies
- 575. Distribute Candies
- 575. Distribute Candies
- Linux查找含有某字符串的所有文件
- SQLyog备份数据库、导入sql脚本、解决Error Code: 2006
- C语言中static的作用
- ElasticSearch-多索引检索与批量操作
- Android控件布局属性全解
- distribute candies
- c#TextBox输入框自动提示、自动完成、自动补全功能
- 思维导图get面试新技能
- angularjs1继承问题
- 字符统计
- VirtualBox 下安装CentOS-6.5
- 机器学习--归一化
- 订单商品信息跨页面传递中的加密与解密及过滤特殊字符串
- BZOJ 1044 洛谷 2511 [HAOI2008] 木棍分割