zoukankan      html  css  js  c++  java
  • LeetCode 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.

    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:
    1. The length of the given array is in range [2, 10,000], and will be even.
    2. The number in given array is in range [-100,000, 100,000].

    Solution:

    先去重,sister最多拿到candies的一半。

    /**
     * @param {number[]} candies
     * @return {number}
     */
    var distributeCandies = function(candies) {
        let temp = [];
        candies.forEach(function(candie) {
            if(temp.indexOf(candie) == -1) {
                temp.push(candie);
            }
        });
        if(temp.length >= candies.length / 2) {
            return candies.length /2 ;
        } else {
            return temp.length;
        }
    };
  • 相关阅读:
    个人博客作业Week2
    个人作业
    软件工程——个人博客作业三
    软工个人博客二
    软件工程——个人博客作业一
    Linux服务器搭建常用环境(一)
    Swift学习之语言基础
    Python——函数的参数
    Python——函数的调用
    Python 导语
  • 原文地址:https://www.cnblogs.com/gogolee/p/7504596.html
Copyright © 2011-2022 走看看