Distribute Candies
来源:互联网 发布:linux开启登录超时锁定 编辑:程序博客网 时间:2024/06/05 07:52
描述:
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.
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].
Subscribe to see which companies asked this question.
链接:点击打开链接
简单题 三行至四行就解决,我用的hashMap 不用这么麻烦 ,用Set一样可以解决。
public static int distributeCandies(int[] candies) { HashMap map=new HashMap(); for(int i=0;i<candies.length;i++) map.put(candies[i],i); if(map.size()>candies.length/2) return candies.length/2; else return map.size(); }
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
- 在SQL Server中创建用户角色及授权
- 单例模式及C++实现代码
- 判断用户flash是否安装了flash以及flash的版本
- Dao模式
- 面试题6:重建二叉树
- Distribute Candies
- 数据结构之栈(链表栈)
- 域名解析过程,很好的一张图收藏了
- Pascal学习之路3——变量运算,场宽
- 事务与储存过程
- jquery ajax请求问题
- 关于malloc(0)的一点疑问
- [编程之美-02]字符串的包含问题
- EA&UML日拱一卒--序列图(Sequence Diagram)::迭代表达式