#include <leetcode.h>
◆ minimumOperations()
int leetcode::minimum_operations_to_make_the_array_alternating::Solution::minimumOperations |
( |
vector< int > & |
nums | ) |
|
|
static |
在文件 leetcode.cpp 第 2804 行定义.
2807 auto a = unordered_map<int, int>();
2808 auto b = unordered_map<int, int>();
2809 for(
int i = 0; i < nums.size(); i++) {
2821 for(
const auto i: a) {
2822 if(maximum < i.second) {
2827 ans1 += a_sum - maximum;
2829 for(
const auto i: b) {
2830 if(i.first != max_num && maximum < i.second) {
2834 ans1 += b_sum - maximum;
2839 for(
const auto i: b) {
2840 if(maximum < i.second) {
2845 ans2 += b_sum - maximum;
2847 for(
const auto i: a) {
2848 if(i.first != max_num && maximum < i.second) {
2852 ans2 += a_sum - maximum;
2853 return min(ans1, ans2);
被这些函数引用 leetcode::minimum_operations_to_make_the_array_alternating::TEST().
该类的文档由以下文件生成: