摘要:
1 1)应该习惯用此种方法 2 3 li = [11,22,33,44,55,77,88,99,90] 4 result = {} 5 for row in li: 6 if row > 66: 7 if 'k1'not in result: 8 result['k1'] = [] 9 result 阅读全文
posted @ 2020-02-29 18:04
不着魔,不成佛
阅读(130)
评论(0)
推荐(0)
摘要:
1 """ 2 计算1-2+3-4+5-6+...+99的积是多少 3 """ 4 sum = 0 5 for i in range(1,100): 6 if i % 2 == 0: 7 sum -= i 8 else: 9 sum += i 10 print(sum) 算法是灵魂,果然精妙呀。还得 阅读全文
posted @ 2020-02-29 18:00
不着魔,不成佛
阅读(98)
评论(0)
推荐(0)
摘要:
1 def sushu(lower,upper): 2 lei = [] 3 for num in range(lower,upper+1): 4 if num > 1: 5 for i in range(2,num): 6 if (num % i ) == 0: 7 break 8 else: 9 阅读全文
posted @ 2020-02-29 09:14
不着魔,不成佛
阅读(122)
评论(0)
推荐(0)