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

    Apporach #1: C++.

    class Solution {
    public:
        int distributeCandies(vector<int>& candies) {
            int size = candies.size();
            unordered_set<int> kinds;
            for (int i = 0; i < size; ++i) {
                kinds.insert(candies[i]);
            }
            return size/2 <= kinds.size() ? size/2 : kinds.size();
        }
    };
    

      

    Apporach #2: Java.

    class Solution {
        public int distributeCandies(int[] candies) {
            HashSet<Integer> set = new HashSet<>();
            for (int candy : candies) 
                set.add(candy);
            return Math.min(set.size(), candies.length/2);
        }
    }
    

      

    Apporach #3: Python.

    class Solution(object):
        def distributeCandies(self, candies):
            """
            :type candies: List[int]
            :rtype: int
            """
            return min(len(candies)/2, len(set(candies)))
    

      

    Time SubmittedStatusRuntimeLanguage
    a few seconds ago Accepted 168 ms python
    3 minutes ago Accepted 109 ms java
    6 minutes ago Accepted 212 ms cpp
    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    数据结构(java语言描述)顺序栈的使用(两个大数相加)
    DB2 Sql性能查看与优化
    spring默认为单例模式
    Java map的匿名类的初始化
    使用nohup后台执行ftp传输命令
    停止一个java的线程执行
    静态类
    XML语法随记
    Crontab有关
    string转Date转回String(JAVA)
  • 原文地址:https://www.cnblogs.com/h-hkai/p/9984572.html
Copyright © 2011-2022 走看看