Python：每日一题 139

Geoffreylee

1. list1 = [3, 7, 10, 11, 12, 14, 15, 17, 18, 19, 20, 21, 22, 24, 26, 27, 28, 30, 32, 34, 35, 36, 39, 41, 42, 43, 45, 48, 49, 53, 64, 74, 78, 80, 88, 90, 91, 95, 96, 103, 107, 116, 142, 148, 152, 153, 158, 163, 171, 173, 174, 175, 176, 179, 181, 188, 190, 201, 204, 207, 216, 218, 222, 231, 235, 239, 248, 250, 251, 253, 258, 262, 265, 278, 292, 295, 296, 301, 305, 313, 317, 320, 326, 332, 334, 347, 355, 357, 358, 363, 365, 366, 368, 375, 377, 381, 391, 414, 417, 426, 428, 437, 438, 445, 453, 459, 466, 474, 476, 477, 489, 494]
   
2. 
   
3. 
   
4. def not_divisible(n):
   
5.     return lambda x: x % n > 0 or x // n == 1
   
6. 
   
7. 
   
8. for i in list1:
   
9.     list1 = list(filter(not_divisible(i), list1))
   
10. 
    
11. print(list1)

复制代码

小贤啊哦

1. def fun116(alist):
   
2.     a=[]
   
3.     m=len(alist)
   
4.     for i in range(1,m):
   
5.         for j in range(i):
   
6.             if alist[i]%alist[j]==0:
   
7.                 a.append(alist[i])
   
8.                 break
   
9.     for k in a:
   
10.         if k in alist:
    
11.             alist.remove(k)
    
12.     return alist

复制代码

kinkon

1. def fun139(nums):
   
2.     p = []
   
3.     for num in nums:
   
4.         for x in p:
   
5.             if num % x == 0:
   
6.                 break
   
7.         else:
   
8.             p.append(num)
   
9.             
   
10.     return p
    
11.    
    
12. list1 = [3, 7, 10, 11, 12, 14, 15, 17, 18, 19, 20, 21, 22, 24, 26, 27, 28, 30, 32, 34, 35, 36, 39, 41, 42, 43, 45, 48, 49, 53, 64, 74, 78, 80, 88, 90, 91, 95, 96, 103, 107, 116, 142, 148, 152, 153, 158, 163, 171, 173, 174, 175, 176, 179, 181, 188, 190, 201, 204, 207, 216, 218, 222, 231, 235, 239, 248, 250, 251, 253, 258, 262, 265, 278, 292, 295, 296, 301, 305, 313, 317, 320, 326, 332, 334, 347, 355, 357, 358, 363, 365, 366, 368, 375, 377, 381, 391, 414, 417, 426, 428, 437, 438, 445, 453, 459, 466, 474, 476, 477, 489, 494]
    
13. print(fun139(list1))

复制代码