CleanSense CleanSense

전체 글

• Level.1 완전탐색 > 모의고사

  Programmers/Python 2021. 5. 3. 12:59

  12345678910111213141516171819202122232425262728293031def solution(answers): answer = [] people1 = [1,2,3,4,5]; people2 = [2,1,2,3,2,4,2,5]; people3 = [3,3,1,1,2,2,4,4,5,5]; cor1 = 0; cor2 = 0; cor3 = 0; for i in range(0,len(answers)): if answers[i] == people1[i%5]: cor1 += 1; if answers[i] == people2[i%8]: cor2 += 1; if answers[i] == people3[i%10]: cor3 += 1; resultDic = {1:cor1, 2:cor2, 3:cor3}..

  Read More

• Level.1 연습문제 > 문자열 내림차순으로 배치하기

  Programmers/Python 2021. 5. 3. 12:58

  123def solution(s): answer = ''.join(sorted(s, reverse=True)); return answercs

  Read More

• Level.1 연습문제 > 문자앨 내 마음대로 정렬하기

  Programmers/Python 2021. 5. 3. 12:56

  123def solution(strings, n): strings.sort(); return sorted(strings, key=lambda x: x[n]);cs

  Read More

• Level.1 연습문제 > 두 정수 사이의 합

  Programmers/Python 2021. 5. 3. 12:55

  123456789101112131415def solution(a, b): answer = 0 if a == b: return a; if a > b: temp = b; b = a; a = temp; for k in range(a, b+1): answer = answer + k; return answercs

  Read More

• Level.1 연습문제 > 나누어 떨어지는 숫자 배열

  Programmers/Python 2021. 5. 3. 12:54

  12345678910111213def solution(arr, divisor): arr.sort(); answer = [] for i in arr: if i % divisor == 0: answer.append(i); if len(answer) == 0: answer.append(-1); return answercs

  Read More

• Level.1 월간 코드 챌린지 시즌1 > 내적

  Programmers/Python 2021. 5. 3. 12:54

  123456def solution(a, b): answer = 0; for i in range(len(a)): answer += a[i] * b[i]; return answercs

  Read More

• Level.1 Summer/Winter Coding > 예산

  Programmers/Python 2021. 5. 3. 12:53

  123456789101112def solution(d, budget): sd = sorted(d); answer = 0; for i in sd: budget -= i; if budget >= 0: answer += 1; else: return answer; return answer;cs

  Read More

• Level.1 연습문제 > 같은 숫자는 싫어

  Programmers/Python 2021. 5. 3. 12:51

  123456789def solution(arr): answer = [] answer.append(arr[0]); for i in arr: if answer[len(answer)-1] != i: answer.append(i); return answercs

  Read More