【LeetCode】Distribute Candies 解题报告
来源:互联网 发布:股票委托交易软件讲解 编辑:程序博客网 时间:2024/05/02 03:03
【LeetCode】Distribute Candies 解题报告
标签(空格分隔): LeetCode
题目地址:https://leetcode.com/problems/distribute-candies/#/description
题目描述:
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].
Ways
题目的意思是把一堆数字平均分成两堆,其中的一堆的最大的种类个数为多少。
第一感觉就是HashMap,统计每个数字出现的次数,然后统计就行,如果种类的数目多于总数字的半数,那么只能选半数的,否则不能平均分成两堆,否则就可以选择种类的个数做最多的分类个数。
public class Solution { public int distributeCandies(int[] candies) { Set<Integer> kinds = new HashSet<Integer>(); for(int candy : candies){ kinds.add(candy); } return Math.min(kinds.size(), candies.length / 2); }}
Date
2017 年 5 月 8 日
0 0
- 【LeetCode】Distribute Candies 解题报告
- [Leetcode] 575. Distribute Candies 解题报告
- LeetCode | 575. Distribute Candies
- LeetCode之Distribute Candies
- leetcode 575. Distribute Candies
- [LeetCode]575. Distribute Candies
- LeetCode 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
- 阿里云机器学习PAI-快速上手指南
- thinkphp缓存
- SqlServer远程连接的建立、删除以及使用
- Python:版本升级
- eclipse 导入项目 有红叉
- 【LeetCode】Distribute Candies 解题报告
- hdu 1754 单点更新
- Java 值传递和引用传递
- JavaScript、jQuery、JSON、AJAX、.Node.JS 这五个之间的关系?
- 网页调扫描仪扫描并显示
- VMware虚拟化概述
- Spring事务管理方式实现
- 【LeetCode】Array Partition I 解题报告
- 系统吞吐量(TPS)、用户并发量、性能测试概念和公式