티스토리

💻

검색하기

블로그 홈

💻

eunhyee.tistory.com/m

코어어오뇬 님의 블로그입니다.

구독자: 8

방명록 방문하기

주요 글 목록

Codility - Lesson 4 - 2. MaxCounters Task Description 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 t.. 공감수 0 댓글수 0 2021. 1. 7.
Codility - Lesson 4 - 1. FrogRiverOne Task Description 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, meas.. 공감수 0 댓글수 0 2021. 1. 5.
Codility - Lesson 3 - 3. TapeEquilibrium Task Description A non-empty array A consisting of N integers is given. Array A represents numbers on a tape. Any integer P, such that 0 < P < N, splits this tape into two non-empty parts: A[0], A[1], ..., A[P − 1] and A[P], A[P + 1], ..., A[N − 1]. The difference between the two parts is the value of: |(A[0] + A[1] + ... + A[P − 1]) − (A[P] + A[P + 1] + ... + A[N − 1])| In other words, it is th.. 공감수 0 댓글수 0 2021. 1. 3.
Codility - Lesson 3 - 2. PermMissingElem Code Description An array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which means that exactly one element is missing. Your goal is to find that missing element. Write a function: def solution(A) that, given an array A, returns the value of the missing element. For example, given array A such that: A[0] = 2 A[1] = 3 A[2] = 1 A[3] = 5 the .. 공감수 0 댓글수 0 2021. 1. 3.
Codility - Lesson 3 - 1. FrogJump Task description A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D. Count the minimal number of jumps that the small frog must perform to reach its target. Write a function: def solution(X, Y, D) that, given three integers X, Y and D, retur.. 공감수 0 댓글수 0 2020. 12. 18.
Codility - Lesson 2 - 1. CyclicRotation Task description An array A consisting of N integers is given. Rotation of the array means that each element is shifted right by one index, and the last element of the array is moved to the first place. For example, the rotation of array A = [3, 8, 9, 7, 6] is [6, 3, 8, 9, 7] (elements are shifted right by one index and 6 is moved to the first place). The goal is to rotate array A K times; that .. 공감수 0 댓글수 0 2020. 12. 9.
Codility - Lesson 1 - 1. BinaryGap Task description A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N. For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains two binary gaps: one of length 4 and one of length 3. The numbe.. 공감수 0 댓글수 0 2020. 12. 8.

문의안내

티스토리
로그인
고객센터

티스토리는 카카오에서 사랑을 담아 만듭니다.