Codility-EquiLeader

最新推荐文章于 2019-08-28 10:21:01 发布

原创最新推荐文章于 2019-08-28 10:21:01 发布 · 1.5k 阅读

0 ·

CC 4.0 BY-SA版权

Codility 同时被 2 个专栏收录

12 篇文章

订阅专栏

Leader

1 篇文章

订阅专栏

本文介绍了一个算法挑战，即在一个整数数组中找到所有EquiLeader的个数。EquiLeader是指一个索引，该索引将数组分成两部分，且这两部分具有相同的主导元素。

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

Task description

A non-empty zero-indexed array A consisting of N integers is given.

The leader of this array is the value that occurs in more than half of the elements of A.

An equi leader is an index S such that 0 ≤ S < N − 1 and two sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N − 1] have leaders of the same value.

For example, given array A such that:

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

we can find two equi leaders:

0, because sequences: (4) and (3, 4, 4, 4, 2) have the same leader, whose value is 4.
2, because sequences: (4, 3, 4) and (4, 4, 2) have the same leader, whose value is 4.

The goal is to count the number of equi leaders. Write a function:

int solution(vector<int> &A);

that, given a non-empty zero-indexed array A consisting of N integers, returns the number of equi leaders.

For example, given:

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

the function should return 2, as explained above.

Assume that:

N is an integer within the range [1..100,000];
each element of array A is an integer within the range [−1,000,000,000..1,000,000,000].

Complexity:

expected worst-case time complexity is O(N);
expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).

Elements of input arrays can be modified.

此题可算作Dominator的扩展题，意思是选定一个下标，将一个数组分为左右两个子数组，使得两个子数组都有相同的leader，则称此下标为EquiLeader，要求返回给定数组中EquiLeader的个数n。事实上，若一个数同时是左子数组的leader，它必然也是整个数组的leader。

因此，此题也是需要先找出序列中的leader，记录其出现的次数。然后再遍历整个数组，枚举分割点，记录下左子数组leader出现的次数s，看s与n-s是否能使得leader在左右子数组中仍为leader。

// you can use includes, for example:
// #include 

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector &A) {
    // write your code in C++11
    int size = 1;
    int value = A[0];
    for(unsigned int i=1;i(k+1)/2)&&((A.size()-k-1)/2<(cnt-leftCnt)))
        res++;
    }
    return res;
}