zoukankan      html  css  js  c++  java
  • LeetCode: 575 Distribute Candies(easy)

    题目:

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

    代码:

     1 class Solution {
     2 public:
     3     int distributeCandies(vector<int>& candies) {
     4         stack<int> tem;
     5         sort(candies.begin(), candies.end());
     6         tem.push(candies[0]);
     7         for (auto c : candies) {
     8             if ( c != tem.top())
     9                 tem.push(c);
    10         }
    11         if ( tem.size() > candies.size()/2)
    12             return candies.size()/2;
    13         else
    14             return tem.size();
    15     }
    16 };

    运行时间:276ms

  • 相关阅读:
    单例模式
    json 格式
    axios 获取不到数据错误
    sprint test 添加事务回滚机制
    springboot An incompatible version [1.1.32] of the APR based Apache Tomcat Native library is installed, while Tomcat requires version [1.2.14]
    spring boot 启动之后404
    废了
    tomcat 部署项目到服务器
    Druid 介绍及配置
    jq 全选
  • 原文地址:https://www.cnblogs.com/llxblogs/p/7405310.html
Copyright © 2011-2022 走看看