import numpy as np
A = np.array([1, 7, 9, 2, 0.1, 17, 17, 1.5])
k = 3
np.argpartition(A, k)[:3]
import heapq
arr=np.array([1,1,1,134,45,3,46,45,65,3,23424,234,12,12,3,546,1,2])
heapq.nlargest(3, range(len(arr)),arr.take)
Numpy查找数组中Top10和Bottom10的索引
最新推荐文章于 2023-03-10 14:08:50 发布