leetcode::maximum_total_beauty_of_the_gardens::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static long long	maximumBeauty (vector< int > &flowers, long long newFlowers, int target, int full, int partial)

详细描述

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

成员函数说明

maximumBeauty()

long long leetcode::maximum_total_beauty_of_the_gardens::Solution::maximumBeauty ( vector< int > & flowers, long long newFlowers, int target, int full, int partial )

static

< 当前项之前的和

< 补齐后n-i项到target后剩余的

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

                                                                                                                       {
            const int n = flowers.size();
            sort(flowers.begin(), flowers.end());
            for(int i = 0; i < n; i++) {
                flowers[i] = min(flowers[i], target);
            }
            long long ans = 0;
            vector<long long> sum(n + 1, 0);
            for(int i = 0; i < n; i++) {
                sum[i + 1] = sum[i] + flowers[i];
            }
            for(int i = 0, j = 0; i <= n; i++) {
                const long long rest = newFlowers - (static_cast<long long>(target) * (n - i) - (sum[n] - sum[i]));
                if(rest >= 0) {
                    while(j < i && rest >= static_cast<long long>(flowers[j]) * j - sum[j]) {
                        //将前j项补齐到flowers[j]
                        j++;
                    }
                    ans = max(ans, static_cast<long long>(full) * (n - i) + (j == 0 ? 0 : static_cast<long long>(partial) * min(static_cast<long long>(target - 1), (rest + sum[j]) / j)));
                }
                if(i < n && flowers[i] == target) {
                    break;
                }
            }
            return ans;
        }

被这些函数引用 leetcode::maximum_total_beauty_of_the_gardens::TEST(), leetcode::maximum_total_beauty_of_the_gardens::TEST() , 以及 leetcode::maximum_total_beauty_of_the_gardens::TEST().

---

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

• leetcode.h
• leetcode.cpp