python 连续三个数满足条件_python – 在numpy数组中找到满足条件的大量连续值

这是一个基于numpy的解决方案。

我认为(？)应该比其他选项快。希望很清楚

然而，它确实需要与各种基于发生器的解决方案相同的存储空间。只要您可以在内存中保存数据的单个临时副本(对于diff)，以及与数据(1位元素)相同长度的布尔数组，则应该非常有效…

import numpy as np

def main():

# Generate some random data

x = np.cumsum(np.random.random(1000) - 0.5)

condition = np.abs(x) < 1

# Print the start and stop indicies of each region where the absolute

# values of x are below 1, and the min and max of each of these regions

for start, stop in contiguous_regions(condition):

segment = x[start:stop]

print start, stop

print segment.min(), segment.max()

def contiguous_regions(condition):

"""Finds contiguous True regions of the boolean array "condition". Returns

a 2D array where the first column is the start index of the region and the

second column is the end index."""

# Find the indicies of changes in "condition"

d = np.diff(condition)

idx, = d.nonzero()

# We need to start things after the change in "condition". Therefore,

# we'll shift the index by 1 to the right.

idx += 1

if condition[0]:

# If the start of condition is True prepend a 0

idx = np.r_[0, idx]

if condition[-1]:

# If the end of condition is True, append the length of the array

idx = np.r_[idx, condition.size] # Edit

# Reshape the result into two columns

idx.shape = (-1,2)

return idx

main()