[algorithm] missing integer

mgm-dev·2021년 4월 20일

codility algorithms

목록 보기

Task description

This is a demo task.

Write a function:

def solution(A)

that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.

For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.

Given A = [1, 2, 3], the function should return 4.

Given A = [−1, −3], the function should return 1.

Write an efficient algorithm for the following assumptions:

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

my solution

def solution(A):
    # write your code in Python 3.6
    s = set(A)
    for i in range(1, 1000000):
        if i not in s:
            return i
never stop learning

관심 있을 만한 포스트

0개의 댓글

관심 있을 만한 포스트