Python: simple code

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307

# !/usr/bin/env python3.6 # -*- coding: utf-8 -*- # visual studio 2017 # 2019 10 12 Geovin Du print from turtle import *; import sys; from math import ceil; import re; import time; import operator; from copy import deepcopy; from random import randint;       print('geovindu');   # 重复元素判定 def all_unique(lst):     return len(lst) == len(set(lst)) x = [1,1,2,2,3,2,3,4,5,6] y = [1,2,3,4,5] all_unique(x) # False all_unique(y) # True   # #字符元素组成判定 from collections import Counter def anagram(first, second):    return Counter(first) == Counter(second) anagram("abcd3", "3acdb") # True #内存占用 variable = 30 print(sys.getsizeof(variable)) # 24 #字节占用 def byte_size(string):     return(len(string.encode('utf-8')))   byte_size('😀') # 4 byte_size('Hello World') # 11  #打印 N 次字符串 n = 2; s ="Programming"; print(s * n); # ProgrammingProgramming #大写第一个字母 s = "programming is awesome" print(s.title()) # Programming Is Awesome #压缩 def compact(lst):     return list(filter(bool, lst))   compact([0, 1, False, 2, '', 3, 'a', 's', 34]) # [ 1, 2, 3, 'a', 's', 34 ]   #解包 array = [['a', 'b'], ['c', 'd'], ['e', 'f']] transposed = zip(*array) print(transposed) # [('a', 'c', 'e'), ('b', 'd', 'f')]   #分块 def chunk(lst, size):     return list(         map(lambda x: lst[x * size:x * size + size],             list(range(0, ceil(len(lst) / size)))))   #链式对比 a = 3 print( 2 < a < 8) # True print(1 == a < 2) # False       # print(len(re.findall(r'[aeiou]', 'foobar', re.IGNORECASE)));   #元音统计 def count_vowels(str):     return len(re.findall(r'[aeiou]', str, re.IGNORECASE))     print('Geovin Du  foobar中有多少个元音字母：'+str(count_vowels('Geovin Du foobar'))) # 3 print('gym中有多少个元音字母：'+str(count_vowels('gym'))) # 0   chunk([1,2,3,4,5],2) # [[1,2],[3,4],5]   #首字母小写 def decapitalize(string):     return string[:1].lower() + string[1:]   print('FooBar:'+decapitalize('FooBar')); # 'fooBar'   def get_str(oriStr,splitStr):      str_list = oriStr.split(splitStr)      if len(str_list) > 1:          for index in range(1, len(str_list)):              if str_list[index] != '':                  str_list[index] = str_list[index][0].upper() + str_list[index][1:]              else:                  continue          return ''.join(str_list)      else:          return oriStr   print('hello_for_our_world:'+get_str('hello_for_our_world','_'));     #展开列表 def spread(arg):     ret = []     for i in arg:         if isinstance(i, list):             ret.extend(i)         else:             ret.append(i)     return ret   def deep_flatten(lst):     result = []     result.extend(         spread(list(map(lambda x: deep_flatten(x) if type(x) == list else x, lst))))     return result     deep_flatten([1, [2], [[3], 4], 5]) # [1,2,3,4,5] #列表的差 def difference(a, b):     set_a = set(a)     set_b = set(b)     comparison = set_a.difference(set_b)     return list(comparison)     difference([1,2,3], [1,2,4]) # [3]   #通过函数取差 def difference_by(a, b, fn):     b = set(map(fn, b))     return [item for item in a if fn(item) not in b]     from math import floor difference_by([2.1, 1.2], [2.3, 3.4],floor) # [1.2] difference_by([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], lambda v : v['x']) # [ { x: 2 } ] #链式函数调用 def add(a, b):     return a + b   def subtract(a, b):     return a - b   a, b = 4, 5 print((subtract if a > b else add)(a, b)) # 9   #检查重复项 def has_duplicates(lst):     return len(lst) != len(set(lst))     x = [1,2,3,4,5,5] y = [1,2,3,4,5] has_duplicates(x) # True has_duplicates(y) # False   #合并两个字典 def merge_two_dicts(a, b):     c = a.copy()   # make a copy of a     c.update(b)    # modify keys and values of a with the ones from b     return c     a = { 'x': 1, 'y': 2} b = { 'y': 3, 'z': 4} print(merge_two_dicts(a, b)) # {'y': 3, 'x': 1, 'z': 4}     #3.5 def merge_dictionaries(a, b):      return {**a, **b}   a = { 'x': 1, 'y': 2} b = { 'y': 3, 'z': 4} print(merge_dictionaries(a, b)) # {'y': 3, 'x': 1, 'z': 4}   #将两个列表转化为字典 def to_dictionary(keys, values):     return dict(zip(keys, values))     keys = ["a", "b", "c"]    values = [2, 3, 4] print(to_dictionary(keys, values)) # {'a': 2, 'c': 4, 'b': 3}   #使用枚举 listd = ["a", "b", "c", "d"] for index, element in enumerate(listd):     print("Value", element, "Index ", index, )   # ('Value', 'a', 'Index ', 0) # ('Value', 'b', 'Index ', 1) #('Value', 'c', 'Index ', 2) # ('Value', 'd', 'Index ', 3)   # 执行时间 start_time = time.time()   a = 1 b = 2 c = a + b print(c) #3   end_time = time.time() total_time = end_time - start_time print("Time: ", total_time)   # ('Time: ', 1.1205673217773438e-05) #Try else try:     2*3 except TypeError:     print("An exception was raised") else:     print("Thank God, no exceptions were raised.")   #Thank God, no exceptions were raised.   #元素频率 def most_frequent(listd):     return max(set(listd), key = listd.count)     listd = [1,2,1,2,3,2,1,4,2] most_frequent(listd)   #回文序列 def palindrome(string):     from re import sub     s = sub('[\W_]', '', string.lower())     return s == s[::-1]     palindrome('taco cat') # True   #不使用 if-else 的计算子 action = {     "+": operator.add,     "-": operator.sub,     "/": operator.truediv,     "*": operator.mul,     "**": pow } print(action['-'](50, 25)) # 25   #Shuffle 该算法会打乱列表元素的顺序，它主要会通过 Fisher-Yates 算法对新列表进行排序 def shuffle(lst):     temp_lst = deepcopy(lst)     m = len(temp_lst)     while (m):         m -= 1         i = randint(0, m)         temp_lst[m], temp_lst[i] = temp_lst[i], temp_lst[m]     return temp_lst     foo = [1,2,3] shuffle(foo) # [2,3,1] , foo = [1,2,3]   #展开列表   def spread(arg):     ret = []     for i in arg:         if isinstance(i, list): #             ret.extend(i)         else:             ret.append(i)     return ret     print('展开列表：'+str(spread([1,2,3,[4,5,6],[7],8,9]))); # [1,2,3,4,5,6,7,8,9]   #交换值 def swap(a, b):   return b, a   a, b = -1, 14 swap(a, b) # (14, -1) spread([1,2,3,[4,5,6],[7],8,9]) # [1,2,3,4,5,6,7,8,9]   #字典默认值 d = {'a': 1, 'b': 2}   print(d.get('c', 3)) # 3         #畫圖形 #https://github.com/asweigart/simple-turtle-tutorial-for-python for i in range(500): # this "for" loop will repeat these functions 500 times     forward(i)     left(91)