Codility编程课一MaxCounters

最新推荐文章于 2019-07-25 19:44:51 发布

「已注销」

最新推荐文章于 2019-07-25 19:44:51 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

分类专栏： python javascript 文章标签： Codility编程 MaxCounters

本文链接：https://blog.youkuaiyun.com/Lockey23/article/details/81366649

这篇博客详细介绍了Codility编程挑战中的MaxCounters问题，包括问题描述、解题思路和Python及JavaScript两种语言的解法。在给定的N个计数器和M个操作中，计算每个计数器在所有操作后的最终值，当操作为增加或全部设置为最大值时，需要返回每个计数器的状态。示例中展示了在N=5和特定操作数组A下，计数器的最终状态为[3, 2, 2, 4, 2]。文章强调了问题的输入限制和解决方案的复杂性分析。" 116810803,8745157,滴滴出行：湾流平台——构建出行中台的演进之路,"['分布式', '大数据', '编程语言', '服务架构', '平台建设']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

MaxCounters

Calculate the values of counters after applying all alternating operations: increase counter by 1; set value of all counters to current maximum.

Description:

You are given N counters, initially set to 0, and you have two possible operations on them:

increase(X) − counter X is increased by 1,
max counter − all counters are set to the maximum value of any counter.
A non-empty array A of M integers is given. This array represents consecutive operations:

if A[K] = X, such that 1 ≤ X ≤ N, then operation K is increase(X),
if A[K] = N + 1 then operation K is max counter.
For example, given integer N = 5 and array A such that:

A[0] = 3
A[1] = 4
A[2] = 4
A[3] = 6
A[4] = 1
A[5] = 4
A[6] = 4

the values of the counters after each consecutive operation will be:

(0, 0, 1, 0, 0)
(0, 0, 1, 1, 0)
(0, 0, 1, 2, 0)
(2, 2, 2, 2, 2)
(3, 2, 2, 2, 2)
(3, 2, 2, 3, 2)
(3, 2, 2, 4, 2)

The goal is to calculate the value of every counter after all operations.

Assume that the following declarations are given:

struct Results {
int * C;
int L; // Length of the array
};

Write a function:

struct Results s

最低0.47元/天解锁文章

200万优质内容无限畅学