작은하마

https://app.codility.com/programmers/lessons/4-counting_elements/perm_check/ PermCheck coding task - Learn to Code - Codility Check whether array A is a permutation. app.codility.com def solution(A): A=sorted(A) if A[0]!=1: return 0 else: for i in range(len(A)-1): if A[i]+1!=A[i+1]: return 0 else : continue return 1

https://app.codility.com/programmers/lessons/2-arrays/odd_occurrences_in_array/start/ Codility Your browser is not supported You should use a supported browser. Read more app.codility.com 배열 A가 주어졌을때 짝이 맞지 않는 수를 반환하는 문제이다. 배열에서 하나의 숫자 빼고는 다 짝이 맞도록 설정이되어있다. st=list(set(a)) for i in st: cnt=a.count(i) if cnt==1: answer=i answer 처음에 이런식으로 접근을 하였는데 55점이 나왔다. 이유는 O(n**2) 시간복잡도가 만족하지 않은것...

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 # you can write to stdout for debugging purposes, e.g. # print("this is a debug message") def solution(A, K): answer=[] if len(A)==0: answer=A elif K==0 or K%len(A)==0 or len(A)==K : answer=A else: K..

https://app.codility.com/programmers/trainings/1/longest_password/ LongestPassword coding task - Practice Coding - Codility Given a string containing words, find the longest word that satisfies specific conditions. app.codility.com 이문제는 isalnum()의 사용과 문자, 숫자 추출을 가능케하는 re.findall을 이용하면 쉽게 풀 수 있었다. 문론 나보다 잘 푸는 사람도 많다. import re s='te$##st 5 a0A pass007 ?xy1' s=s.split(' ') max=-1 for i in s: if i...

https://app.codility.com/demo/results/trainingJCD5A7-MFN/ Test results - Codility 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 app.codility.com A binary gap within a positive integer N i..