python 查找二维数组长度,在Python中查找二维数组中一对数字的频率

I want to find frequency of pairs in a 2D array.

Sample inputs is as follows:

list_of_items = [[12,14,18],[12,19,54,89,105],[ 14, 19],[54, 88 ,105,178]]

Expected Output is as following:

(12,14):1

(12,18):1

(12,19):1

(12,54):1

(12,88):0

.

.

.

(54,105):2

.

.

I have tried following code but I think it is not optimal solution:

number_set = [ 12, 14, 18,19,54,88,89 , 105, 178]

def get_frequency_of_pairs(list_of_items, number_set):

x=1

combination_list = []

result = {}

for i in number_set:

for j in range(x,len(number_set)):

combination_list = combination_list +[(i,number_set[j])]

x = x+1

for t in combination_list:

result[t]=0

for t in combination_list:

for items in list_of_items:

if( set(t).issubset(items) ):

result[t]=result[t]+1

return result

解决方案

You can use combinations from itertools and use a Counter from collections as follows:

counts = collections.Counter()

list_of_items = [[12,14,18], [12,19,54,89,105], [14,19], [54,88,105,178]]

for sublist in list_of_items:

counts.update(itertools.combinations(sublist, 2))

print counts

Counter({(54, 105): 2, (88, 105): 1, (54, 89): 1, (19, 105): 1, (12, 14): 1, (14, 19): 1, (14, 18): 1, (12, 89): 1, (12, 19): 1, (89, 105): 1, (12, 18): 1, (19, 89): 1, (19, 54): 1, (105, 178): 1, (88, 178): 1, (54, 178): 1, (12, 105): 1, (12, 54): 1, (54, 88): 1})

Each pair has to be enumerated to be counted, and this method enables you to enumerate each pair only once. Should be best possible time complexity.