The life of TB

# while loop## Write a while loop that is initialized at 0 and stops at 15.# If the counter is an even number, append the counter to # a list called eve_nums.eve_nums = []start = 0stop = 15while start

Python 2024. 11. 18. 14:28

# 조건식의 결과에 따라 할당문의 내용을 바꿀 수 있다. def main(): userScore = 100 defaultScore = 100  msg = "you did it" if userScore > defaultScore else "you didn't made it" print(msg) if __name__ == "__main__": main() # 결과you didn't made it # 조건식의 결과에 따라 실행 함수를 바꿀 수 있다. def printAdult(): print("adult") def printChild(): print("child") def isAdult(): adult = 0 prtintAdult() if adult else printChild() isAdult() # 결과c..

Python 2024. 10. 15. 16:37

# random, zip, dict 사용해 숫자가 몇 번 나왔는지 카운트 하기 import random def main(): i = random.randint(1, 5) keys, values = [], [0] * i for key in range(i): keys.append(random.randint(1, i)) ds = dict(zip(keys, values)) for key in keys: ds[key] += 1 print('key generated:', keys) print('key count:', ds) pass if __name__ == '__main__': main() # 결과 1 key generated: [2, 1] key count: {2: 1, 1: 1} # 결과 2 key gener..

Python 2023. 5. 2. 23:59

# dict로 구현한 select case def one(): print ("one") def two(): print ("two") def three(): print ("three") def default(): print ("default") func_map = { 1 : one, 2 : two, 3 : three } i = int(input("Select a number (1-3): ")) try: func_map.get(i)() except: default() ===================== Select a number (1-3): 1 one Select a number (1-3): 99 default ===================== # 값을 리턴하는 select case def sel..

Python 2021. 5. 16. 19:31

# tree - preordertree = [('a', [('b', [('d', []), ('e', [])]), ('c', [('f', [])])])] def preorder(tree):stack = [tree[0]]output = []while stack:value, children = stack.pop()output.append(value)stack.extend(reversed(children))return output print(preorder(tree)) # 결과['a', 'b', 'd', 'e', 'c', 'f'] # tree - preordertree = [('a', [('b', [('d', []), ('e', [])]), ('c', [('f', [])])])] from collections ..

Python 2016. 6. 12. 10:25

# datetime module import datetime start = datetime.datetime.now()i = 0while i < 10000:i += 1end = datetime.datetime.now() # 결과0:00:00.014491

Python 2016. 6. 8. 21:54

# Width and Precision # d1 = '%5d' % -10# print(d1) # d2 = '%5d' % 10# print(d2) # dd = '%05d' % -10# print(dd) # s = '%.*s' % (3, 'apple')# print(s) # from math import pi # pp = '[%010.2f]' % pi# print(pp) # pp2 = '[%-10.2f]' % pi# print(pp2) # p = '[%9f]' % pi# print(p) # p = '[%5.2f]' % pi# print(p) # p = '[%.2f]' % pi# print(p) # p = '[%0.2f]' % pi# print(p) # priceOfHam = 'Price of ham: $%d..

Python 2016. 6. 4. 00:27

# Sequential Searchdef seq_search(arr, ele):pos = 0 while len(arr) > pos:if arr[pos] == ele:return Trueelse:pos += 1 return False o = seq_search([1, 2, 3,], 3)print(o) # 결과True # Binary Searchdef binary_search(arr, ele):first = 0last = len(arr) - 1 found = False while first arr[k + 1]:temp = arr[k]arr[k] = arr[k + 1]arr[k + 1] = tempreturn arr arr = [5, 3, 7, 2]o = bubble_sort(arr)print(o) # 결과[..

Python 2016. 5. 31. 12:53