Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
Tags
- @Scheduled
- 스프링
- GOF
- Arrays
- java
- 코딩테스트
- 프로그래머스
- pair
- vuejs #vue #js #프론트엔드 #nodejs #클라이언트사이드 #템플릿엔진
- maven
- 스프링 부트
- Spring
- 프로젝트 구조
- codility
- 의존성관리
- thymeleaf
- Spring Mail
- mybatis
- spring scheduler
- 스프링부트
- Collections
- pom.xml
- Spring Boot
- springboot
- 스프링 메일
- Dependency
- C++
- 스프링 스케줄러
- list
- HashMap
Archives
- Today
- Total
Rooted In Develop
[Codility] Sorting - Distinct / Java 본문
1. 문제
Write a function
class Solution { public int solution(int[] 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–2020 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
2. 코드
import java.util.*;
class Solution {
public int solution(int[] A) {
HashSet<Integer> set = new HashSet<>();
for(int i=0; i<A.length; i++) {
set.add(A[i]);
}
return set.size();
}
}
'Algorithm Test > Java' 카테고리의 다른 글
[Codility] Sorting - Triangle / Java (0) | 2020.06.14 |
---|---|
[Codility] Sorting - MaxProductOfThree / Java (0) | 2020.06.14 |
[Codility] Prefix Sums - MinAvgTwoSlice / Java (0) | 2020.06.14 |
[Codility] Prefix Sums - GenomicRangeQuery / Java (0) | 2020.06.14 |
[Codility] Prefix Sums - CountDiv / Java (0) | 2020.06.14 |
Comments