LeetCode 575. Distribute Candies

575. Distribute Candies

一、问题描述

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.

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].

二、输入输出

Example 1:

Input: candies = [1,1,2,2,3,3]
Output: 3
Explanation:
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: 2
Explanation: 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.

三、解题思路

题目的意思是找到最多的不同的数字，这个个数不能超过总数字个数的一半。

把原字符存储到map中并记录下每个数字出现的个数。依次遍历这个map，如果个数为正，那么类型数就加1 总个数也加1 类型数不会超过map的size 总个数不能超过原数组长度的一半。这两个判断条件是关键。

class Solution {
public:int distributeCandies(vector<int>& candies) {map<int, int> dict;for (auto ite : candies){if(dict.find(ite) == dict.end()) dict.insert(make_pair(ite, 1));else dict[ite]++;}int ret = 0, count = 0, tot = candies.size(), totKind = dict.size();for (auto ite : dict){if(ite.second > 0) {ite.second--;ret++;count++;}if(ret >= totKind || count >= tot/2)break;}return ret;}
};

LeetCode 575. Distribute Candies相关推荐

LeetCode | 575. Distribute Candies
题外话:又是N久没有更博,今后争取每天总结. Leetcode上的新题,难度是Easy,我是按照acceptance刷的,所以经常遇到新题^_________^ 题目: Given an intege ...
575. Distribute Candies*
575. Distribute Candies* https://leetcode.com/problems/distribute-candies/ 题目描述 Given an integer arr ...
[]575. Distribute Candies
problem 575. Distribute Candies 理解题意:主要是计算candies的种类数. 如果大于candies数目的一半,则返回一半的值,否则,返回candies的种类数. so ...
575. Distribute Candies 平均分糖果，但要求种类最多
［抄题］: Given an integer array with even length, where different numbers in this array represent diffe ...
Distribute Candies
Distribute Candies int distributeCandies(vector& candies) { int cnt = 1;//初始有一种int N = candies.s ...
C#LeetCode刷题之#575-分糖果（Distribute Candies）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3798 访问. 给定一个偶数长度的数组,其中不同的数字代表着不同种 ...
LeetCode 575. 分糖果（set集合去重）
1. 题目给定一个偶数长度的数组,其中不同的数字代表着不同种类的糖果,每一个数字代表一个糖果.你需要把这些糖果平均分给一个弟弟和一个妹妹.返回妹妹可以获得的最大糖果的种类数. 输入: candies ...
leetcode 575. 分糖果
class Solution(object):def distributeCandies(self, candies):""":type candies: List[in ...
leetcode 575 分糖果
class Solution {public int distributeCandies(int[] candies) {int pre=-100001;Arrays.sort(candies);in ...

LeetCode 575. Distribute Candies

575. Distribute Candies

一、问题描述

二、输入输出

三、解题思路

LeetCode 575. Distribute Candies相关推荐

最新文章

热门文章