빠르고 꾸준하게

자료구조 & 알고리즘/프로그래머스(programmers)

programmers - 키패드 누르기

programmers.co.kr/learn/courses/30/lessons/67256 코딩테스트 연습 - 키패드 누르기 [1, 3, 4, 5, 8, 2, 1, 4, 5, 9, 5] "right" "LRLLLRLLRRL" [7, 0, 8, 2, 8, 3, 1, 5, 7, 6, 2] "left" "LRLLRRLLLRR" [1, 2, 3, 4, 5, 6, 7, 8, 9, 0] "right" "LLRLLRLLRL" programmers.co.kr def distance(x,y): return abs(x[0]-y[0])+abs(x[1]-y[1]) #거리구하는 함수 def solution(numbers, hand): answer = '' keypad = {1:(0, 0), 2:(0, 1), 3:(0, 2), 4:..

자료구조 & 알고리즘/프로그래머스(programmers)

programmers -모의고사

answers = [1,3,2,4,2] ans = [] students = [] students.append([1,2,3,4,5]*2000) students.append([2,1,2,3,2,4,2,5]*1250) students.append([3,3,1,1,2,2,4,4,5,5]*1000) cnt = [0]*len(answers) for i in range(3): for j in range(len(answers)): if students[i][j] == answers[j]: cnt[i] +=1 cnt.sort(reverse=True) answer = [] for i in range(3): if cnt[i] == max(cnt): answer.append(i+1) print(answer)

자료구조 & 알고리즘/프로그래머스(programmers)

programmers - 문자열내 p와y의 개수

def solution(s): p = s.count('p'or'P') y = s.count('y'or'Y') if (p == 0 and y == 0): return True if (p == y): return True else: return False 왜 안될까..... ------------------------------------------------------------------------------------- def solution(s): answer = True if(s.count('p')+s.count('P') != s.count('y')+s.count('Y')): answer = False return answer

자료구조 & 알고리즘/프로그래머스(programmers)

Programmers - 약수의 합

def solution(n): answer = 0 for i in range(n): if i>0: if n%i==0: answer+=i answer += n return answer ------------------------------------------------------------------------------------------ def solution(num): return num + sum([i for i in range(1, (num // 2) + 1) if num % i == 0])