분류 전체보기

[프로그래머스] 정수 삼각형

📌문제 https://programmers.co.kr/learn/courses/30/lessons/43105 🎖️난이도 Level 3 ✔️풀이 # sol1 def solution(triangle): i_len = len(triangle) # 5 for i in range(1, i_len): for j in range(i+1): # i++ if j == 0: triangle[i][j] += triangle[i-1][0] continue # i++, j++ elif i == j: triangle[i][j] += triangle[i-1][j-1] continue # i++ or i++, j++ triangle[i][j] = max(triangle[i-1][j-1]+triangle[i][j], triangle[..

[프로그래머스] N으로 표현

📌문제 https://programmers.co.kr/learn/courses/30/lessons/42895 🎖️난이도 Level 3 ✔️풀이 # sol def solution(N,number): answer=-1 S=[set() for x in range(8)] for i,x in enumerate(S,start=1): x.add(int(str(N)*i)) for i in range(1,len(S)): for j in range(i): for op1 in S[j]: for op2 in S[i-j-1]: S[i].add(op1+op2) S[i].add(op1-op2) S[i].add(op1*op2) if op2!=0: S[i].add(op1//op2) if number in S[i]: answer=i+1..

[프로그래머스] 가장 큰 수

📌문제 https://programmers.co.kr/learn/courses/30/lessons/42746 🎖️난이도 Level 2 ✔️풀이 # sol def solution(numbers): numbers = list(map(str, numbers)) numbers.sort(key = lambda x : x*3, reverse=True) return str(int(''.join(numbers)))

[프로그래머스] K번째수

📌문제 https://programmers.co.kr/learn/courses/30/lessons/42748 🎖️난이도 Level 1 ✔️풀이 # sol1 def solution(array, commands): answer = [] for command in commands: arr_tmp = array arr_tmp = arr_tmp[command[0]-1:command[1]] arr_tmp.sort() answer.append(arr_tmp[command[2]-1]) return answer # sol2) lambda def solution(array, commands): return list(map(lambda x:sorted(array[x[0]-1:x[1]])[x[2]-1], commands)) ..

[프로그래머스] 더 맵게

📌문제 https://programmers.co.kr/learn/courses/30/lessons/42626 🎖️난이도 Level 2 ✔️풀이 # sol) heapq 이용 import heapq def solution(scoville, K): cnt = 0 heapq.heapify(scoville) ''' s_list = [] for s in scoville: heapq.heappush(s_list, s) ''' while 1: if len(scoville) == 1 and scoville[0] = K: return cnt else: cnt += 1 heapq.heappush(scoville, heapq.heappop(scoville) + heap..