본문 바로가기

Lesson 4

[Codility] Lesson 4 : MissingInteger - JAVA 문제 This is a demo task. Write a function: class Solution { public int solution(int[] 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 effic.. 더보기
[Codility] Lesson 4 : MaxCounters - JAVA 문제 You are given N counters, initially set to 0, and you have two possible operations on them: · increase(X) − counter X is increased by 1, · max counter − all counters are set to the maximum value of any counter. A non-empty array A of M integers is given. This array represents consecutive operations: · if A[K] = X, such that 1 ≤ X ≤ N, then operation K is increase(X), · if A[K] = N + 1 then op.. 더보기
[Codility] Lesson 4 : PermCheck - JAVA 문제 A non-empty array A consisting of N integers is given. A permutation is a sequence containing each element from 1 to N once, and only once. For example, array A such that: A[0] = 4 A[1] = 1 A[2] = 3 A[3] = 2 is a permutation, but array A such that: A[0] = 4 A[1] = 1 A[2] = 3 is not a permutation, because value 2 is missing. The goal is to check whether array A is a permutation. Write a functi.. 더보기
[Codility] Lesson 4 : FrogRiverOne - JAVA 문제 A small frog wants to get to the other side of a river. The frog is initially located on one bank of the river (position 0) and wants to get to the opposite bank (position X+1). Leaves fall from a tree onto the surface of the river. You are given an array A consisting of N integers representing the falling leaves. A[K] represents the position where one leaf falls at time K, measured in second.. 더보기

티스토리툴바