개발자식

문제 : MaxCounters Test results - Codility 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. T app.codility.com You are given N counters, initially set to 0, and you have two possible operations on t..

문제 : PermCheck Test results - Codility 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] = app.codility.com A non-empty array A consisting of N integers is given. A permutation is a sequence con..

문제 : MissingInteger Test results - Codility 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 = app.codility.com 나의 코드 - Detected time complexity: O(N) or O(N * log(N)) - 마이너스로만 이루어진 경우 먼저 확인 -..

문제 : FrogRiverOne Test results - Codility 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 app.codility.com 문제 해석 : 개구리가 강을 건너기 위해 나뭇잎이 1부터 X까지 (위치)떨어져 있어야 한다. 배열A는 시간(인덱스)에 따라 떨어지는 위치가 담겨있다...

문제 : NumberSolitaire Test results - Codility A game for one player is played on a board consisting of N consecutive squares, numbered from 0 to N − 1. There is a number written on each square. A non-empty array A of N integers contains the numbers written on the squares. Moreover, some squares can app.codility.com 나의 풀이 - dp table에 이전 합과 이전합+현재 값의 최대 값으로 갱신하는 방법을 생각했는데 이건 배열에서 만들 수 있는 최대 합을 구하는 ..

문제: TapeEquilibrium Test results - Codility A non-empty array A consisting of N integers is given. Array A represents numbers on a tape. Any integer P, such that 0 TIMEOUT ERROR def..