575. Distribute Candies
来源:互联网 发布:淘宝评价怎么添加视频 编辑:程序博客网 时间:2024/06/06 03:06
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].
public class Solution { public int distributeCandies(int[] candies) { Set<Integer> s=new HashSet<>(); for(int i:candies) { s.add(i); } return Math.min(candies.length/2,s.size()); }}
阅读全文
0 0
- 575. Distribute Candies
- 575. Distribute Candies
- LeetCode | 575. Distribute Candies
- 575. Distribute Candies
- 575. Distribute Candies
- leetcode 575. Distribute Candies
- 575. Distribute Candies
- [LeetCode]575. Distribute Candies
- [leetcode]: 575. Distribute Candies
- 575. Distribute Candies
- 575. Distribute Candies
- [leetcode]575. Distribute Candies
- [easy]575. Distribute Candies
- LeetCode 575. Distribute Candies
- leetcode.575. Distribute Candies
- LeetCode 575. Distribute Candies
- 575. Distribute Candies
- 575. Distribute Candies
- bzoj 1202: [HNOI2005]狡猾的商人(带权并查集)
- Python的numpy.random模块中文简介
- hdu 2955 Robberies
- TCP握手和挥手
- [NOIp复习计划]:模拟
- 575. Distribute Candies
- 基站查询网址、软件、API接口汇总
- 华为优招面试失败反思
- C#客户端(WinForm)自动登录
- 跳转绝对地址
- 使用@Named注解(一个接口多个实现,匹配引入想要的实现类)
- 扎克伯格写给员工的Facebook内部PPT
- EA&UML日拱一卒-活动图::AcceptEventAction
- JZOJ 7.11B组第三题 进化序列