leetcode::minimum_difference_in_sums_after_removal_of_elements::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数
static long long	minimumDifference (vector< int > &nums)

详细描述

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

成员函数说明

minimumDifference()

long long leetcode::minimum_difference_in_sums_after_removal_of_elements::Solution::minimumDifference ( vector< int > &  nums )

static

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

                                                               {
            const int n         = nums.size() / 3;
            auto *left_sum      = new long long[n];
            auto *right_sum     = new long long[n];
            long long left_min  = 0;
            long long right_max = 0;
            auto left_n         = priority_queue<int>();
            auto right_n        = priority_queue<int, vector<int>, greater<>>();
            for(int i = 0; i < n; i++) {
                left_n.push(nums[i]);
                left_min += nums[i];
            }
            for(int i = 3 * n - 1; i >= 2 * n; i--) {
                right_n.push(nums[i]);
                right_max += nums[i];
            }
            const long long left_min_preserve  = left_min;
            const long long right_max_preserve = right_max;
            left_sum[0]                        = left_min;
            right_sum[n - 1]                   = right_max;
            for(int i = n; i < 2 * n; i++) {
                if(nums[i] < left_n.top()) {
                    left_min += nums[i] - left_n.top();
                    left_n.pop();
                    left_n.push(nums[i]);
                }
                left_sum[i - n] = left_min;
            }
            for(int i = 2 * n - 1; i >= n; i--) {
                if(nums[i] > right_n.top()) {
                    right_max += nums[i] - right_n.top();
                    right_n.pop();
                    right_n.push(nums[i]);
                }
                right_sum[i - n] = right_max;
            }
            long long ans = left_min_preserve - right_sum[0];
            for(int i = 0; i < n - 1; i++) {
                ans = min(ans, left_sum[i] - right_sum[i + 1]);
            }
            ans = min(ans, left_sum[n - 1] - right_max_preserve);
            delete[] left_sum;
            delete[] right_sum;
            return ans;
        }

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

---

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

• leetcode.h
• leetcode.cpp