如何优化这段代码的运行时间？

Question

This intersection two-dimensional array represents the number of times that scenic spot B also appeared when scenic spot A appeared. Now this code takes about 1 minute and 30 seconds to get the result. Is it possible to get the result of this code in 10 seconds?

for a in range ((len(user_record[0]))):#len(user_record[0]) is 1136
    b = 0
    for b in range ((len(user_record[0]))): #len(user_record[0]) is 1136
        c = 0
        Intersection[a][b] = 0
        for c in range (len(user_record)): #len(user_record) is 31
            Intersection[a][b] = Intersection[a][b] + user_record[c-1][a] * user_record[c-1][b]

Answer 1

I suggest moving your data to numpy structures. After that, there are many functions like intersect1d that resolve this kind of problems in the right manner.