leetcode::maximum_candies_allocated_to_k_children::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static int	maximumCandies (vector< int > &candies, long long k)

详细描述

在文件 leetcode.h 第 2057 行定义.

成员函数说明

maximumCandies()

int leetcode::maximum_candies_allocated_to_k_children::Solution::maximumCandies ( vector< int > &  candies, long long  k  )

static

在文件 leetcode.cpp 第 5581 行定义.

                                                                      {
            sort(candies.begin(), candies.end());
            long long sum = 0;
            for(const auto candy: candies) {
                sum += candy;
            }
            int l = 1;
            int r = sum / k;
            if(sum < k) {
                return 0;
            }
            while(l < r) {
                if(l + 1 == r) {
                    unsigned long long count = 0;
                    for(auto it = candies.rbegin(); it != candies.rend() && *it >= r; ++it) {
                        count += *it / r;
                        if(count > k) {
                            break;
                        }
                    }
                    if(count > k) {
                        return r;
                    }
                    return l;
                }
                const int m              = (l + r) / 2;
                unsigned long long count = 0;
                for(auto it = candies.rbegin(); it != candies.rend() && *it >= m; ++it) {
                    count += *it / m;
                    if(count > k) {
                        break;
                    }
                }
                if(count >= k) {
                    l = m;
                } else if(count < k) {
                    r = m;
                }
            }
            return (l + r) / 2;
        }

被这些函数引用 leetcode::maximum_candies_allocated_to_k_children::TEST().

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp