H!GHR

https://app.codility.com/programmers/lessons/3-time_complexity/frog_jmp/ FrogJmp coding task - Learn to Code - Codility Count minimal number of jumps from position X to Y. app.codility.com 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 class Solution { public int solution(int X, int Y, int D) { // write your code in Java SE 8 int cnt = 0; while(X Colored by Color Scripter 역시 루프는 시간복잡도를 잡아먹는 괴물같다

https://app.codility.com/programmers/lessons/2-arrays/cyclic_rotation/ CyclicRotation coding task - Learn to Code - Codility Rotate an array to the right by a given number of steps. app.codility.com 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 class Solution { public int[] solution(int[] A, int K) { if(A.length == 1) { return A; } int remainder = K % A.length; //배열 ..

https://app.codility.com/programmers/lessons/2-arrays/odd_occurrences_in_array/ OddOccurrencesInArray coding task - Learn to Code - Codility Find value that occurs in odd number of elements. app.codility.com 배열 안에 있는 수 중, 짝이 없는 애만 찾아서 리턴하면 된다. 처음에 시도한 방법 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 class Solution { public int solution(int[] A) { int answer = 0; for(int i = 0..

https://app.codility.com/programmers/lessons/1-iterations/binary_gap/ BinaryGap coding task - Learn to Code - Codility Find longest sequence of zeros in binary representation of an integer. app.codility.com 이진법 사이에 있는 0의 개수를 구하면 된다. 1001이면 2 1000이면 0 1000101이면 3 으로 리턴하면 된다. 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 32 33 34 35 import java.util.ArrayList;..