leetcode 575. Distribute Candies
来源:互联网 发布:软件开发图片 编辑:程序博客网 时间:2024/05/16 03:29
原题:
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: 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.大意就是,每个数字代表不同的种类,哥哥和妹妹将蜡烛分一半,看妹妹能拿到多少种不同的蜡烛。
代码如下:
int distributeCandies(int* candies, int candiesSize) { int cmp(const int *a,const int *b) { return *(int*)a-*(int*)b; } qsort(candies,candiesSize,sizeof(int),cmp); int result=1; int flag=*(candies); for(int n=0;n<candiesSize;n++) { if(flag!=*(candies+n)) { flag=*(candies+n); result++; } } if(result>candiesSize/2) return candiesSize/2; return result;}思路如下,先进行排序,排序完成后检测不同,小于size/2,肯定就是拿不同的,大于或者等于size/2,也就最多拿到一半的不同。
阅读全文
0 0
- LeetCode | 575. Distribute Candies
- leetcode 575. Distribute Candies
- [LeetCode]575. Distribute Candies
- [leetcode]: 575. Distribute Candies
- [leetcode]575. Distribute Candies
- LeetCode 575. Distribute Candies
- leetcode.575. Distribute Candies
- LeetCode 575. Distribute Candies
- [LeetCode]575.Distribute Candies
- leetcode 575. Distribute Candies
- LeetCode: 575. Distribute Candies
- LeetCode#575. Distribute Candies
- LeetCode 575. Distribute Candies
- 【LeetCode】575. Distribute Candies
- [LeetCode]575. Distribute Candies
- [LeetCode]575. Distribute Candies
- <LeetCode>575. Distribute Candies
- leetcode 575. Distribute Candies
- Azkaban简介和使用
- Java中使用频率较高的函数
- Vbox linux虚拟机连接外网
- 你应该知道的9篇深度学习论文(CNNs 理解)
- android4.4如何不保存连接验证失败的WiFi热点
- leetcode 575. Distribute Candies
- centos开启telnet服务
- 1Z0-051 37. You issued the following command to drop the PRODUCTS table:
- springMVC工作原理
- leetcode No150. Evaluate Reverse Polish Notation
- dbutils 介绍与使用
- Hibernate5的hibernate.cfg.xml基本配置
- Uva 933 Product of digits
- 熊猫TV技术与直播技术相关