leetcode::all_divisions_with_the_highest_score_of_a_binary_array::Solution类 参考

#include <leetcode.h>

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

详细描述

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

成员函数说明

maxScoreIndices()

vector< int > leetcode::all_divisions_with_the_highest_score_of_a_binary_array::Solution::maxScoreIndices ( vector< int > &  nums )

static

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

                                                               {
            const auto n       = nums.size();
            auto left_0_count  = vector<int>();
            auto right_1_count = vector<int>();
            left_0_count.push_back(0);
            right_1_count.push_back(0);
            int count = 0;
            for(int i = 0; i < n; i++) {
                if(nums[i] == 0) {
                    count++;
                }
                left_0_count.push_back(count);
            }
            count = 0;
            for(int i = n - 1; i >= 0; i--) {
                if(nums[i] == 1) {
                    count++;
                }
                right_1_count.push_back(count);
            }
            right_1_count = vector(right_1_count.rbegin(), right_1_count.rend());
            int maximum   = 0;
            for(int i = 0; i <= n; i++) {
                maximum = max(maximum, left_0_count[i] + right_1_count[i]);
            }
            auto ans = vector<int>();
            for(int i = 0; i <= n; i++) {
                if(maximum == left_0_count[i] + right_1_count[i]) {
                    ans.push_back(i);
                }
            }
            return ans;
        }

---

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

• leetcode.h
• leetcode.cpp