一:使用python对ip地址排序所用代码示例一: import socket iplist = ['10.5.11.1','192.168.1.33','10.5.2.4','10.5.1.3','10.5.11.13','10.5.11.12','10.5.1.1','10.5.1.2','10.5.1.11','10.5.1.13'] print(sorted(iplist,key=socket.inet_aton)) for i in sorted(iplist,key=socket.i…
一些常用的排序 #系统内置排序算法#list.sort()#heapq模块 def sys_heap_sort(list): import heapq heap = [] for i in range(len(list)): heapq.heappush(heap,list[i]) for i in range(len(heap)): list[i] = heapq.heappop(heap) #python操作列表的方法,它们的时间复杂度 #insert() ---> O(n) #remov…
def func(listNode): listNode.reverse() for i in listNode: print(i) li = [1,2,3,4,5] func(li) 利用python列表函数reverse()将列表倒叙,然后遍历打印,但是这有一个缺点就是改变了原列表的顺序.看看下面的代码: def func(listNode): array = listNode[::-1] for i in array: print(i) li = [1,2,3,4,5] func(li)…