일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- stateless
- was
- Bruteforce
- TDD
- Stack
- Q objects
- HTTP 완벽 가이드
- Django
- Programmers
- 백준
- Git
- codecov
- Unit Testing
- dictionary
- ORM
- stateful
- combinations
- AWS
- Python
- ws
- SQL
- Query
- utils
- algorithm
- postreSQL
- stack&que
- permutations
- pytest
- greedy
- Gunicorn
- Today
- Total
목록전체 글 (69)
해피 코딩!
link def black_jack(value): lst = list(map(int, input().split(' '))) max_data =0 for index in range(len(lst)-2): for indent_1_index in range(index+1, len(lst)-1): for indent_2_index in range(indent_1_index+1, len(lst)): data = lst[index]+ lst[indent_1_index]+ lst[indent_2_index] if (data =max_data): max_data = data return max_data _, value = map(int, input().split(' ')) print(bla..
link length = int(input()) lst = [0]* length stack = [0] * length # 모든 값을 넣은다. for index, value in enumerate(lst): weight, height = map(int, input().split(' ')) lst[index] = weight, height # 비교 for index, value in enumerate(lst): rank = 1 for indent_1, indent_1_value in enumerate(lst): if index == indent_1: continue if (value[0] < indent_1_value[0]) and (value[1]
link def solution(priorities, location): answer = [] lst = [i for i in range(len(priorities))] while priorities: if priorities[0] == max(priorities): answer.append(lst.pop(0)) priorities.pop(0) else: lst.append(lst.pop(0)) priorities.append(priorities.pop(0)) return answer.index(location)+1
link # 시간 초과 def solution(prices): answer = [0] * len(prices) for index, value in enumerate(prices): for indent_index, indent_value in enumerate(prices[index+1:]): if value = prices[index]: answer[index] +=1 else: answer[index] +=1 break return answer
link def solution(participant, completion): from collections import defaultdict dic = defaultdict(int) for part in participant: dic[part] += 1 for comp in completion: dic[comp] -= 1 return max(dic, key=dic.get)
link def solution(answers): answer = [] soopo_1 = [1, 2, 3, 4, 5,] soopo_2 = [2, 1, 2, 3, 2, 4, 2, 5] soopo_3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5] soopo1 = 0 soopo2 = 0 soopo3 = 0 for index in range(len(answers)): if soopo_1[index % len(soopo_1)] == answers[index]: soopo1 += 1 if soopo_2[index % len(soopo_2)] == answers[index]: soopo2 += 1 if soopo_3[index % len(soopo_3)] == answers[index]: soopo3 +..
link def solution(numbers): answer = [] for val in range(len(numbers)): for val_2 in range(len(numbers)): if val == val_2: pass else: value = numbers[val] + numbers[val_2] answer.append(value) answer = set(answer) # print(list(answer)) return sorted(answer)