算法系列(20) Leetcode 575. Distribute Candies
2018-01-07 20:49
501 查看
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:
Example 2:
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].
思路:主要是算出来有多少种蜡烛,用set能够很好的达到去重效果
/**
* @param {number[]} candies
* @return {number}
*/
var distributeCandies = function(candies) {
var len1 = candies.length;
var set = new Set(candies);
var len2 = set.size;
if(len2>=len1/2){
return len1/2;
}else{
return len2;
}
};
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: 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.
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].
思路:主要是算出来有多少种蜡烛,用set能够很好的达到去重效果
/**
* @param {number[]} candies
* @return {number}
*/
var distributeCandies = function(candies) {
var len1 = candies.length;
var set = new Set(candies);
var len2 = set.size;
if(len2>=len1/2){
return len1/2;
}else{
return len2;
}
};
相关文章推荐
- 算法系列(16)Leetcode 387 First Unique Character in a String
- 算法系列(19)Leetcode 344. Reverse String
- 算法系列(15)LeetCode 171
- LeetCode 笔记系列 20 Interleaving String [动态规划的抽象]
- 算法系列(14) Leetcode 492. Construct the Rectangle
- 算法系列(17) Leetcode 104. Maximum Depth of Binary Tree
- Leetcode 算法题20
- 算法系列(3)leetcode27
- 算法练习专题——LeetCode系列之 Two Sum
- 每天学习一算法系列(20)(输入一个表示整数的字符串,把该字符串转换成整数并输出)
- 算法系列(4) leetcode26
- 算法练习专题——LeetCode系列之 ThreeSum
- python写算法题:leetcode: 20. Valid Parentheses
- 算法系列(7)leetcode 206
- 算法系列(5) leetcode350
- 算法系列(11)LeetCode136 Single Number
- 算法系列(9) LeetCode256
- 算法系列(18) Leetcode 496. Next Greater Element I
- 【Leetcode系列之二】Leetcode OJ 11-20
- 算法系列(12)LeetCode292 Nim Game