增添了新筹备

Author: Littlefean

050 map/main.py

@@ -0,0 +1,15 @@
+# oj算法题输入
+a, b = map(int, input().split())
+
+# 自己快速写一个举例列表
+list_of_ints = list(map(int, "1234567"))
+
+
+# 转大写
+def upper(s):
+    return s.upper()
+
+
+lst = list(map(upper, ['sentence', 'fragment']))
+print(lst)
+# ['SENTENCE', 'FRAGMENT']

050 setOption/setOption.py

@@ -19,3 +19,4 @@
 
 s3: set
 # 如何实现一个有序集合
+

050 setOption/字典套集合.py

@@ -0,0 +1,5 @@
+graph = {
+    1: {1, 2, 3},
+    2: {2, 3},
+    3: {1},
+}

050 setOption/无重复列表.py

@@ -0,0 +1,57 @@
+import _ctypes
+
+
+class SetList:
+    def __init__(self):
+        self.lst = []
+        self.dic = {}
+
+    def add(self, val):
+        if val in self.dic:
+            return
+        else:
+            self.dic[val] = len(self.lst)
+            self.lst.append(val)
+
+    def __iter__(self):
+        for item in self.lst:
+            yield item
+
+    def __contains__(self, item):
+        return item in self.dic
+
+    def remove(self, item):
+        if item not in self.dic:
+            return
+        delIndex = self.dic[item]
+        self.dic.pop(item)  # 删除dic里的数据
+        popRes = self.lst[delIndex]
+        self.lst[delIndex] = self.lst[-1]
+        self.dic[self.lst[-1]] = delIndex
+        self.lst.pop()
+        return popRes
+
+    def __str__(self):
+        res = "<"
+        for i, item in enumerate(self.lst):
+            res += str(item)
+            if i != len(self.lst) - 1:
+                res += ", "
+        return res + ">"
+
+    __repr__ = __str__
+
+
+sl = SetList()
+print(sl)
+
+sl.add(13)
+sl.add(15)
+sl.add(14)
+print(sl)
+sl.remove(15)
+print(sl)
+sl.remove(14)
+print(sl)
+sl.remove(13)
+print(sl)

050 try catch完整写法/main.py

@@ -22,4 +22,22 @@ def f():
 
 
 for i in range(10):
-    print(i)
+    print(i)
+
+
+# heapq内置库代码
+# Short-cut for n==1 is to use max()
+#     if n == 1:
+#         it = iter(iterable)
+#         sentinel = object()
+#         if key is None:
+#             result = max(it, default=sentinel)
+#         else:
+#             result = max(it, default=sentinel, key=key)
+#         return [] if result is sentinel else [result]
+#
+#     # When n>=size, it's faster to use sorted()
+#     try:
+#         size = len(iterable)
+#     except (TypeError, AttributeError):
+#         pass

050 小顶堆/main.py

@@ -8,11 +8,10 @@
     print(heapq.heappop(h))  # 每次弹出的时候都会维护一下小顶
     print(h)
 
-
 #
 # https://leetcode.cn/problems/qn8gGX/
 
 
 # 序列比较默认比较的是第一个元素
 
-
+print(heapq.nlargest(2, [1, 2, 3, 4, 5, 3, 2, 1]))

050 快速写一个类，dataclass，nametuple/main.py

@@ -0,0 +1,32 @@
+# -*- encoding: utf-8 -*-
+"""
+PyCharm main
+2022年05月26日
+by littlefean
+"""
+from typing import *
+from dataclasses import dataclass
+
+
+@dataclass
+class Card:
+    rank: str
+    suit: str
+
+
+card = Card("Q", "hearts")
+print(card == card)
+# True
+
+print(card.rank)
+# 'Q'
+print(card)
+Card(rank='Q', suit="hearts")
+
+
+def main():
+    return None
+
+
+if __name__ == "__main__":
+    main()

050 快速写一个类，dataclass，nametuple/nt.py

@@ -0,0 +1,27 @@
+from collections import namedtuple
+
+# 两种方法来给 namedtuple 定义方法名
+User = namedtuple('User', ['name', 'age', 'id'])
+user = User('tester', '22', '464643123')
+
+print(user)
+# User(name='tester', age='22', id='464643123')
+
+# *--------------------------------
+# https://www.manongdao.com/article-2068272.html
+from enum import IntEnum
+
+NAME, AGE, SEX, EMAIL = range(4)
+s = ('jim', 16, 'male', 'jim8721 @ gmail.com')
+
+
+class StudentEnum(IntEnum):
+    NAME = 0
+    AGE = 1
+    SEX = 2
+    EMAIL = 3
+
+
+print(StudentEnum.NAME)
+print(s[StudentEnum.NAME])
+isinstance(StudentEnum.NAME, int)

050 有序字典/main.py

@@ -1,9 +1,20 @@
 from collections import OrderedDict
 
+dic = {}
 o = OrderedDict()
-o["a"] = 15
+string = "aoiwevnaekl"
+for char in string:
+    dic[char] = 1
+    o[char] = 1
+
+print(dic)
 print(o)
-o["b"] = 20
+
+dic.pop("o")
+o.pop("o")
+
+print(dic)
 print(o)
-o["b"] = 25
-print(o)
+
+# 3.7 字典和orderedDict一样有顺序了
+

050 有序字典/字典额外操作.py

@@ -0,0 +1,10 @@
+# 合并字典
+
+dict1 = {'a': 1, 'b': 2}
+dict2 = {'b': 3, 'c': 4}
+merged = {**dict1, **dict2}
+print(merged)
+# {'a': 1, 'b': 3, 'c': 4}
+
+#  如果存在相同的key，来自第一个字典的key会被覆盖。
+