//调用方法
List<double> data = new List<double>{25, 8, 15, 5, 6, 10, 10, 3, 1, 20, 7};
List<int> index = getPeaksIndex(trendSign(oneDiff(data)));

//第一次寻峰（基本峰距为1）算法
private double[] oneDiff(List<double> data)
{double[] result = new double[data.Count - 1];for (int i = 0; i < result.Length; i++){result[i] = data[i + 1] - data[i];}return result;
}private int[] trendSign(double[] data)
{int[] sign = new int[data.Length];for (int i = 0; i < sign.Length; i++){if (data[i] > 0) sign[i] = 1;else if (data[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;}}}return sign;
}private List<int> getPeaksIndex(int[] diff)
{List<int> data = new List<int>();for (int i = 0; i != diff.Length - 1; i++){if (diff[i + 1] - diff[i] == -2){data.Add(i + 1);}}return data;//相当于原数组的下标
}

            // 调用方法List<double> Xaxis = new List<double> { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };List<double> Yaxis = new List<double> { 25, 8, 15, 5, 6, 10, 10, 3, 1, 20, 7 };// 峰距int DisPeak = 3;// 峰距为3时得到的脚标List<int> index = getPeaksIndex(trendSign(oneDiff(Yaxis)));// 已进行的判断int level = 1;// 扩大峰距范围范围算法while (DisPeak > level){level++;List<int> result = DoPeakInstance(Yaxis, index, level);index = null;index = result;}// 获取两侧满足条件的边峰序列index = GetBothSidePeakIndex(Xaxis, Yaxis, 1, index);double minFZ = 10.0;// 根据最小峰值序列进行筛选index = FindMinPeakValue(minFZ, Yaxis, index);

        //扩大寻峰范围算法private List<int> DoPeakInstance(List<double> data, List<int> index, int level){//相当于原数组的下标List<int> result = new List<int>();for (int i = 0; i < index.Count; i++){//判断是否超出下界和上界if (index[i] - level >= 0 && index[i] + level < data.Count){if (data[index[i] + level] <= data[index[i]] && data[index[i] - level] <= data[index[i]]){result.Add(index[i]);}}}return result;}

        //获取两侧满足条件的边峰序列private static List<int> GetBothSidePeakIndex(List<double> Xaxis, List<double> Yaxis, int FJ, List<int> index){//获取数据首尾两侧最大峰值（0，FJ）点序和（Date.CountFJ-FJ,Data.Count）点序int TopIndex = 0;int BottomIndex = Yaxis.Count - 1;for (int i = 0; i < FJ; i++){if (Yaxis[i] >= Yaxis[TopIndex]){TopIndex = i;}if (Yaxis[Yaxis.Count - 1 - i] >= Yaxis[BottomIndex]){BottomIndex = Yaxis.Count - 1 - i;}}//判断是否满足条件检索条件int newTopIndex = TopIndex;int newBottomIndex = BottomIndex;for (int i = 0; i <= FJ; i++){if (Yaxis[TopIndex + i] >= Yaxis[TopIndex]){newTopIndex = TopIndex + i;}if (Yaxis[BottomIndex - i] >= Yaxis[BottomIndex]){newBottomIndex = BottomIndex - i;}}TopIndex = newTopIndex;BottomIndex = newBottomIndex;//添加到结果序列if (TopIndex <= FJ && TopIndex != 0){index.Insert(0, TopIndex);}if (BottomIndex >= BottomIndex - FJ && BottomIndex != Xaxis.Count - 1){index.Add(BottomIndex);}return index;}

        //根据最小峰值序列进行筛选private static List<int> FindMinPeakValue(double minFZ, List<double> Yaxis, List<int> index){List<int> finalresult = new List<int>();for (int i = 0; i < index.Count; i++){if (Yaxis[index[i]] >= minFZ){finalresult.Add(index[i]);}}index = null;index = finalresult;return index;}