The life of TB

# 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

# Stack Implementation class Stack(object): def __init__(self): self.items = [] def isEmpty(self): return self.items == [] def push(self, item): self.items.append(item) def pop(self): return self.items.pop() def peek(self): return self.items[len(self.items)-1] def size(self): return len(self.items) s = Stack() print(s.isEmpty()) s.push(1) s.push('two') print(s.peek()) print(s.size()) s.pop() s.p..

Python 2016. 5. 27. 11:37

http://python-3-patterns-idioms-test.readthedocs.io/en/latest/PatternConcept.html So the goal of design patterns is to isolate changes in your code. If you look at it this way, you’ve been seeing some design patterns already in this book. For example, inheritance can be thought of as a design pattern (albeit one implemented by the compiler). It allows you to express differences in behavior (that..

Python 2016. 5. 17. 10:30

# inclusive_range# start, stop, step class Inclusive_range():def __init__(self, *args):num_args = len(args)if num_args < 1:raise TypeError('requires at least one argument')elif num_args == 1:self.start = 0self.stop = args[0]self.step = 1elif num_args == 2:(self.start, self.stop) = argsself.step = 1elif num_args == 3:(self.start, self.stop, self.step) = argselse:raise TypeError('expected at most ..

Python 2016. 5. 12. 14:46

# Data Transfer Object class Pool:def __init__(self, **kwargs):self.__dict__ = kwargs m = Pool(one=1, two=2, three=3)m.four=4print(m.one)print(m.two, m.three) # 결과12 3

Python 2016. 5. 11. 15:29