wargame

python challenge - level 1

http://www.pythonchallenge.com/pc/def/map.html 12345678910111213string = "g fmnc wms bgblr rpylqjyrc gr zw fylb. rfyrq ufyr amknsrcpq ypc dmp. bmgle gr gl zw fylb gq glcddgagclr ylb rfyr'q ufw rfgq rcvr gq qm jmle. sqgle qrpgle.kyicrpylq() gq pcamkkclbcb. lmu ynnjw ml rfc spj" answer = '' for i in range(0, len(string)): if string[i] == 'y': answer += 'a' elif string[i] == 'z': answer += 'b' elif..

2019. 1. 27. 22:26
Programing/자료구조, Algorithm

programmers - 더맵게[level2] - python

12345678910111213141516import heapqdef solution(scoville, K): answer = 0 scoville.sort() scoville = [scoville[i] for i in range(0, len(scoville)) if scoville[i]

2019. 1. 26. 03:46
Programing/자료구조, Algorithm

programmers - 올바른괄호[level2] - python

123456789101112131415def solution(s): lst =[] if s.count('(') == s.count(')') and s[0] == '(' and s[-1] == ')': for i in range(0, len(s)): if s[i] == '(': lst.append('(') elif s[i] == ')': try: lst.pop() except: print('except') return False else: return False return TrueColored by Color Scriptercs

2019. 1. 26. 02:49
Programing/자료구조, Algorithm

programmers - 주식가격[level2] - python

12345678910111213def solution(prices): answer = [] for i in range(0, len(prices)-1): # (0,3) 0,1,2 for j in range(i+1, len(prices)): # 1,4 1,2,3 if prices[i] > prices[j]: answer.append(j-i) break if j == len(prices)-1: answer.append(j-i) answer.append(0) return answerColored by Color Scriptercs

2019. 1. 26. 02:47
Programing/자료구조, Algorithm

programmers - 스킬트리[level2] - python

123456789101112131415161718192021222324252627282930def solution(skill, skill_trees): answer = len(skill_trees) skill_tmp = '' skill_lst = [skill[i] for i in range(0, len(skill))] for i in range(0, len(skill_trees)): for j in range(0, len(skill_trees[i])): for k in range(0, len(skill_lst)): if skill_trees[i][j] == skill_lst[k]: skill_tmp += skill_lst[k] print(skill_tmp) if len(skill_tmp) == 0: pa..

2019. 1. 25. 20:16
Programing/자료구조, Algorithm

programmers - 탑[level2] - python

1234567891011121314def solution(heights): answer = [0] tmp = [] for i in range(len(heights)-1, 0, -1): # 역순 for j in range(i-1, -1, -1): if heights[i]

2019. 1. 24. 00:47