finish ch3

Author: AstinCHOI

3장_컬렉션_데이터_구조/10_is_anagram_using_ord.py

@@ -0,0 +1,23 @@
+import string
+
+def hash_func(astring):
+    s = 0
+    for one in astring:
+        if one in string.whitespace:
+            continue
+        s = s + ord(one)
+    return s
+
+def find_anagram_hash_function(word1, word2):
+    return hash_func(word1) == hash_func(word2)
+
+def test_find_anagram_hash_function():
+    word1 = 'buffy'
+    word2 = 'bffyu'
+    word3 = 'bffya'
+    assert(find_anagram_hash_function(word1, word2) == True)
+    assert(find_anagram_hash_function(word1, word3) == False)
+    print("테스트 통과!")
+    
+if __name__ == '__main__':
+    test_find_anagram_hash_function()

3장_컬렉션_데이터_구조/11_find_dice_probabilities.py

@@ -0,0 +1,27 @@
+from collections import Counter, defaultdict
+
+def find_dice_probabilities(S, n_faces=6):
+    if S > 2 * n_faces or S < 2:
+        return None
+    
+    cdict = Counter()
+    ddict = defaultdict(list)
+      
+    for dice1 in range(1, n_faces+1):
+        for dice2 in range(1, n_faces+1):
+            t = [dice1, dice2]
+            cdict[dice1+dice2] += 1
+            ddict[dice1+dice2].append(t)
+
+    return [cdict[S], ddict[S]]
+
+def test_find_dice_probabilities():
+    n_faces = 6
+    S = 5
+    results = find_dice_probabilities(S, n_faces)
+    print(results)
+    assert(results[0] == len(results[1]))
+    print("테스트 통과!")
+
+if __name__ == '__main__':
+    test_find_dice_probabilities()

3장_컬렉션_데이터_구조/12_delete_duplicate_char_str.py

@@ -0,0 +1,18 @@
+import string
+
+def delete_unique_word(str1):
+    table_c = { key: 0 for key in string.ascii_lowercase }
+    for i in str1:
+        table_c[i] += 1
+    for key, value in table_c.items():
+        if value > 1:
+            str1 = str1.replace(key, "")
+    return str1
+
+def test_delete_unique_word():
+    str1 = "google"
+    assert(delete_unique_word(str1) == 'le')
+    print('테스트 통과!')
+
+if __name__ == '__main__':
+    test_delete_unique_word()

3장_컬렉션_데이터_구조/1_set_operations_with_lists.py

@@ -0,0 +1,26 @@
+def remove_dup(l1):
+    """ 리스트의 중복된 항목을 제거한 후 반환한다. """
+    return list(set(l1))
+
+def intersection(l1, l2):
+    """ 교집합 결과를 반환한다. """
+    return list(set(l1) & set(l2))
+
+def union(l1, l2):
+    """ 합집합 결과를 반환한다. """
+    return list(set(l1) | set(l2))
+
+def test_sets_operations_with_lists():
+    l1 = [1, 2, 3, 4, 5, 5, 9, 11, 11, 15]
+    l2 = [4, 5, 6, 7, 8]
+    l3 = []
+    assert(remove_dup(l1) == [1, 2, 3, 4, 5, 9, 11, 15])
+    assert(intersection(l1, l2) == [4,5])
+    assert(union(l1, l2) == [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 15])
+    assert(remove_dup(l3) == [])
+    assert(intersection(l3, l2) == l3)
+    assert(sorted(union(l3, l2)) == sorted(l2))
+    print("테스트 통과!")
+
+if __name__ == '__main__':
+    test_sets_operations_with_lists()

3장_컬렉션_데이터_구조/2_set_operations_with_dicts.py

@@ -0,0 +1,29 @@
+def  set_operations_with_dict():
+    pairs = [('a', 1), ('b',2), ('c',3)]
+    d1 = dict(pairs)
+    print(d1)
+    
+    d2 = {'a':1, 'c':2, 'd':3, 'e':4}
+    print(d2)
+    
+    union = d1.keys() & d2.keys()
+    print(union)
+    
+    union_items = d1.items() & d2.items()
+    print(union_items)
+    
+    subtraction1 = d1.keys() - d2.keys()
+    print(subtraction1)
+    
+    subtraction2 = d2.keys() - d1.keys()
+    print(subtraction2)
+    
+    subtraction_items = d1.items() - d2.items()
+    print(subtraction_items)
+
+    """ 딕셔너리의 특정 키를 제외한다. """
+    d3 = {key: d2[key] for key in d2.keys() - {'c', 'd'}}
+    print(d3)
+
+if __name__ == '__main__':
+    set_operations_with_dict()

3장_컬렉션_데이터_구조/1_setdefault_example.py renamed to 3장_컬렉션_데이터_구조/3_setdefault_example.py

@@ -0,0 +1,11 @@
+import timeit
+import random
+
+for i in range(10000,1000001,20000):
+    t = timeit.Timer("random.randrange(%d) in x" % i, 
+                     "from __main__ import random, x")
+    x = list(range(i)) # 리스트
+    lst_time = t.timeit(number=1000)
+    x = {j:None for j in range(i)} # 딕셔너리
+    d_time = t.timeit(number=1000)
+    print("%d,%10.3f,%10.3f" % (i, lst_time, d_time))

3장_컬렉션_데이터_구조/4_runtime_dicts_with_timeit_module.py

@@ -0,0 +1,19 @@
+from collections import defaultdict
+
+def  defaultdict_example():
+    pairs = {('a', 1), ('b',2), ('c',3)}   
+    
+    d1 = {}
+    for key, value in pairs:
+        if key not in d1:
+            d1[key] = []
+        d1[key].append(value)
+    print(d1)
+
+    d2 = defaultdict(list)
+    for key, value in pairs:
+        d2[key].append(value)
+    print(d2)
+
+if __name__ == '__main__':
+    defaultdict_example()

3장_컬렉션_데이터_구조/5_defaultdict_example.py

@@ -0,0 +1,18 @@
+from collections import OrderedDict
+
+def orderedDict_example():
+    pairs = [('c', 1), ('b',2), ('a',3)]
+    d1 = {}
+    for key, value in pairs:
+        if key not in d1:
+            d1[key] = []
+        d1[key].append(value)
+    for key in d1:
+        print(key, d1[key])
+
+    d2 = OrderedDict(pairs)
+    for key in d2:
+        print(key, d2[key])
+
+if __name__ == '__main__':
+    orderedDict_example()

3장_컬렉션_데이터_구조/6_orderedDict_example.py

@@ -0,0 +1,26 @@
+from collections import Counter
+
+def counter_example():
+    ''' 항목의 발생 횟수를 매핑하는 딕셔너리를 생성한다. '''
+    seq1 = [1, 2, 3, 5, 1, 2, 5, 5, 2, 5, 1, 4]
+    seq_counts = Counter(seq1)
+    print(seq_counts)
+    
+    ''' 항목의 발생 횟수를 수동으로 갱신하거나, update() 메서드를 사용할 수 있다. '''
+    seq2 = [1, 2, 3]
+    seq_counts.update(seq2)
+    print(seq_counts)
+    
+    seq3 = [1, 4, 3]
+    for key in seq3:
+        seq_counts[key] += 1
+    print(seq_counts)
+        
+    ''' a+b, a-b와 같은 셋 연산을 사용할 수 있다. '''
+    seq_counts_2 = Counter(seq3)
+    print(seq_counts_2)  
+    print(seq_counts + seq_counts_2)  
+    print(seq_counts - seq_counts_2)
+    
+if __name__ == '__main__':
+    counter_example()