Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.

AVAILABLE LESSONS:

Lesson 1

Iterations

Lesson 2

Arrays

Lesson 3

Time Complexity

Lesson 4

Counting Elements

Lesson 5

Prefix Sums

Lesson 6

Sorting

Lesson 7

Stacks and Queues

Lesson 8

Leader

Lesson 9

Maximum slice problem

Lesson 10

Prime and composite numbers

Lesson 11

Sieve of Eratosthenes

Lesson 12

Euclidean algorithm

Lesson 13

Fibonacci numbers

Lesson 14

Binary search algorithm

Lesson 15

Caterpillar method

Lesson 16

Greedy algorithms

Lesson 17

Dynamic programming

Spoken language:

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

int solution(int A[], int N);

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

Copyright 2009–2022 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

int solution(vector<int> &A);

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

Copyright 2009–2022 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

class Solution { public int solution(int[] A); }

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

Copyright 2009–2022 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

func Solution(A []int) int

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

class Solution { public int solution(int[] A); }

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

class Solution { public int solution(int[] A); }

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

function solution(A);

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

fun solution(A: IntArray): Int

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

function solution(A)

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

int solution(NSMutableArray *A);

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

function solution(A: array of longint; N: longint): longint;

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

function solution($A);

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

sub solution { my (@A)=@_; ... }

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

def solution(A)

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

def solution(a)

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

object Solution { def solution(a: Array[Int]): Int }

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

public func solution(_ A : inout [Int]) -> Int

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

对于一个给定的整数数组, "支配者"是在这个数组中出现的频率超过一半的整数.

例如:

数值"3"出现过5次, 5/8 > 0.5, 所以数值"3"是一个"支配者";

而在这个数组中, 这个"支配者"出现在数组下标:

- 0, 2, 4, 6 , 7.

请写一个函数

Private Function solution(A As Integer()) As Integer

对给定数组返回其任意一个支配者的数组下标。

例如，对上述数组，函数可以返回0，2，4，6，7中的任意一个。 如果没有支配者，函数应该返回 −1。

假定:

- N 是 [0..100,000] 内的 整数;
- 数组 A 每个元素是取值范围 [−2,147,483,648..2,147,483,647] 内的 整数 .

An array A consisting of N integers is given. The *dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7) and 5 is more than a half of 8.

Write a function

int solution(int A[], int N);

that, given an array A consisting of N integers, returns index of any element of array A in which the dominator of A occurs. The function should return −1 if array A does not have a dominator.

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

An array A consisting of N integers is given. The *dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7) and 5 is more than a half of 8.

Write a function

int solution(vector<int> &A);

that, given an array A consisting of N integers, returns index of any element of array A in which the dominator of A occurs. The function should return −1 if array A does not have a dominator.

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

An array A consisting of N integers is given. The *dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7) and 5 is more than a half of 8.

Write a function

class Solution { public int solution(int[] A); }

that, given an array A consisting of N integers, returns index of any element of array A in which the dominator of A occurs. The function should return −1 if array A does not have a dominator.

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

func Solution(A []int) int

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

class Solution { public int solution(int[] A); }

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

class Solution { public int solution(int[] A); }

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

function solution(A);

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

fun solution(A: IntArray): Int

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

function solution(A)

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

Note: All arrays in this task are zero-indexed, unlike the common Lua convention. You can use `#A` to get the length of the array A.

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

int solution(NSMutableArray *A);

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

function solution(A: array of longint; N: longint): longint;

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

function solution($A);

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

sub solution { my (@A)=@_; ... }

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

def solution(A)

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

def solution(a)

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

object Solution { def solution(a: Array[Int]): Int }

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

public func solution(_ A : inout [Int]) -> Int

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].

*dominator* of array A is the value that occurs in more than half of the elements of A.

For example, consider array A such that

Write a function

Private Function solution(A As Integer()) As Integer

For example, given array A such that

the function may return 0, 2, 4, 6 or 7, as explained above.

Write an ** efficient** algorithm for the following assumptions:

- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].