C# 查询波峰、波谷

代码如下：

/// <summary>
/// 寻峰（查找波峰或者波谷）
/// </summary>
/// <param name="data">数据源</param>
/// <param name="IsTrough">0:波峰 1:波谷 2:波峰和波谷</param>
/// <returns></returns>
public static int[] FindPeaks(double[] data,int PeakStyle)
{
    double[] diff = new double[data.Length - 1];
    for (int i = 0; i < diff.Length; i++)
    {
        diff[i] = data[i + 1] - data[i];
    }
    int[] sign = new int[diff.Length];
    for (int i = 0; i < sign.Length; i++)
    {
        if (diff[i] > 0) sign[i] = 1;
        else if (diff[i] == 0) sign[i] = 0;
        else sign[i] = -1;
    }
    for (int i = sign.Length - 1; i >= 0; i--)
    {
        if (sign[i] == 0 && i == sign.Length - 1)
        {
            sign[i] = 1;
        }
        else if (sign[i] == 0)
        {
            if (sign[i + 1] >= 0)
            {
                sign[i] = 1;
            }
            else
            {
                sign[i] = -1;
            }
        }
    }
    List<int> result = new List<int>();
    for (int i = 0; i != sign.Length - 1; i++)
    {
        if (PeakStyle == 0)
        {
            if (sign[i + 1] - sign[i] == -2)
            {
                result.Add(i + 1);
            }
        }
        else if (PeakStyle == 1)
        {
            if (sign[i + 1] - sign[i] == 2)
            {
                result.Add(i + 1);
            }
        }
        else if(PeakStyle == 2)
        {
            if (Math.Abs(sign[i + 1] - sign[i]) == 2)
            {
                result.Add(i + 1);
            }
        }
    }
    return result.ToArray();//相当于原数组的下标
}