문제 요약
Array [2, 1, 1, 2, 3, 1] 이 주어지면
distinct한 값은 1, 2, 3 이고 개수는 3이다.
이것을 리턴하는것.
풀이
- distinct는 set으로 쉽게 풀 수 있어서 set으로 품
function solution(A) {
return (new Set(A)).size
}문제 전문
Write a function
function solution(A);
that, given an array A consisting of N integers, returns the number of distinct values in array A.
For example, given array A consisting of six elements such that:
A[0] = 2 A[1] = 1 A[2] = 1
A[3] = 2 A[4] = 3 A[5] = 1
the function should return 3, because there are 3 distinct values appearing in array A, namely 1, 2 and 3.
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 [−1,000,000..1,000,000].
Copyright 2009–2022 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
