zoukankan      html  css  js  c++  java
  • 1431. Kids With the Greatest Number of Candies

    Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid has.

    For each kid check if there is a way to distribute extraCandies among the kids such that he or she can have the greatest number of candies among them. Notice that multiple kids can have the greatest number of candies.

    Example 1:

    Input: candies = [2,3,5,1,3], extraCandies = 3
    Output: [true,true,true,false,true] 
    Explanation: 
    Kid 1 has 2 candies and if he or she receives all extra candies (3) will have 5 candies --- the greatest number of candies among the kids. 
    Kid 2 has 3 candies and if he or she receives at least 2 extra candies will have the greatest number of candies among the kids. 
    Kid 3 has 5 candies and this is already the greatest number of candies among the kids. 
    Kid 4 has 1 candy and even if he or she receives all extra candies will only have 4 candies. 
    Kid 5 has 3 candies and if he or she receives at least 2 extra candies will have the greatest number of candies among the kids. 
    

    Example 2:

    Input: candies = [4,2,1,1,2], extraCandies = 1
    Output: [true,false,false,false,false] 
    Explanation: There is only 1 extra candy, therefore only kid 1 will have the greatest number of candies among the kids regardless of who takes the extra candy.
    

    Example 3:

    Input: candies = [12,1,12], extraCandies = 10
    Output: [true,false,true]
    

    Constraints:

    • 2 <= candies.length <= 100
    • 1 <= candies[i] <= 100
    • 1 <= extraCandies <= 50
    class Solution {
        public List<Boolean> kidsWithCandies(int[] candies, int extraCandies) {
            int[] arr = Arrays.copyOf(candies, candies.length);
            Arrays.sort(arr);
            List<Boolean> res = new ArrayList();
            for(int i: candies){
                if(i + extraCandies >= arr[arr.length - 1]) res.add(true);
                else res.add(false);
            }
            return res;
        }
    }
        public List<Boolean> kidsWithCandies(int[] cs, int e) {
            int max = 0;
            List<Boolean> res = new ArrayList<>();
            for (int n : cs) max = Math.max(n, max);
            for (int n : cs) res.add(n + e >= max);
            return res;
        }

    https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/discuss/667598/Java-2-loops

  • 相关阅读:
    分布式事务的四种解决方案
    uber-go/guide 的中文翻译
    域名解析-CNAME
    Nginx节点存活状态检查
    Laravel核心解读--中间件(Middleware)
    Mac dyld: Library not loaded: /usr/local/opt/openssl/lib/libcrypto.1.0.0.dylib
    前缀树算法实现路由匹配原理解析
    原创-实用salt部署文档(持续更新)
    线上案例-调参-设置滑动窗口提高视频云播放性能
    NGINX日志割切
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13156851.html
Copyright © 2011-2022 走看看