Python: 每日一题 34

小庆子

1. def longest_consec(listr,n):
   
2.     n_list = []
   
3.     for i in range(len(listr)):
   
4.         temp = [len(listr[i]),listr[i]]
   
5.         n_list.append(temp)
   
6.         temp = []
   
7.     n_list.sort(reverse=True)
   
8.     result = ('')
   
9.     time = 0
   
10.     while time != n :
    
11.         result += str(n_list[time][1])
    
12.         time += 1
    
13.     print(result)
    
14.         
    
15. 
    
16. longest_consec(["zone", "abigail", "theta", "form", "libe", "zas", "theta", "abigail"], 2)  

复制代码