出现次数的数组

Question

print(exit) 打印两点之间基点的方向！！！！！！ print(exit.count('N'))统计North出现的次数！！！ print(dist(x,y,x+grad_x,y+grad_y))显示这两点之间的距离！！！！！

我想知道如何创建一个['N', 'NE', 'E', 'SE', 'S', 'SW', 'W', 'NW', 'W'] 类型的数组，其中的值是每个基点出现的次数

代码

for x,y in new_points:
    cv2.circle(frame, (x, y), 10, (0, 255,), 1)

    if vector_points.size != 0:
        grad_x, grad_y = x-vector_points[i][0], y-vector_points[i][1]
        cv2.arrowedLine(frame, (x,y),(x+grad_x, y+grad_y) , (0,255,255), 1)
        exit = direcao(x+grad_x, x, y+grad_y, y)
        print(exit)
        print(exit.count('N'))
        print(dist(x,y,x+grad_x,y+grad_y))
        #tmp.append((dist(x,y,x+grad_x,y+grad_y)))
        #print(tmp)
    i+=1

Answer 1

虽然我不熟悉你使用的方法，但如果我理解你的问题，我可以告诉你我的解决方案是defaultdict。

from collections import defaultdict

counts = defaultdict(int)
directions = ['N', 'NE', 'E', 'SE', 'S', 'SW', 'W', 'NW', 'W']

for x,y in new_points:
    cv2.circle(frame, (x, y), 10, (0, 255,), 1)

    if vector_points.size != 0:
        grad_x, grad_y = x-vector_points[i][0], y-vector_points[i][1]
        cv2.arrowedLine(frame, (x,y),(x+grad_x, y+grad_y) , (0,255,255), 1)
        exit = direcao(x+grad_x, x, y+grad_y, y)
        print(exit)

        for direction in directions:
            # this assumes exit.count() returns an int
            counts[direction] += exit.count(direction)
        print(dist(x,y,x+grad_x,y+grad_y))
        #tmp.append((dist(x,y,x+grad_x,y+grad_y)))
        #print(tmp)
    i+=1

for direction, count in counts.items():
    print(f'{direction} appears a total of {count} times.')

如果您想知道new_points 中每个点的次数，您只需在循环的每次迭代中创建一个新的defaultdict 并将其附加到list。

您也可以按照您的要求将其分配给一个数组。

directions = ['N', 'NE', 'E', 'SE', 'S', 'SW', 'W', 'NW', 'W']
counts = [0, 0, 0, 0, 0, 0, 0, 0, 0]

for x,y in new_points:
    cv2.circle(frame, (x, y), 10, (0, 255,), 1)

    if vector_points.size != 0:
        grad_x, grad_y = x-vector_points[i][0], y-vector_points[i][1]
        cv2.arrowedLine(frame, (x,y),(x+grad_x, y+grad_y) , (0,255,255), 1)
        exit = direcao(x+grad_x, x, y+grad_y, y)
        print(exit)

        for elem, direction in enumerate(directions):
            counts[elem] += exit.count(direction)

        print(dist(x,y,x+grad_x,y+grad_y))
    i+=1

print(counts)