java实现findpeaks函数

import java.util.ArrayList;
import java.util.List;

public class FindPeaksTest {

	// //参数：数组，数组大小
	public static void findPeaks(int[] num, int count) {
		List<Integer> sign = new ArrayList<Integer>();
		for (int i = 1; i < count; i++) {
			/* 相邻值做差： *小于0，，赋-1 *大于0，赋1 *等于0，赋0 */
			int diff = num[i] - num[i - 1];
			if (diff > 0) {
				sign.add(1);
			} else if (diff < 0) {
				sign.add(-1);
			} else {
				sign.add(0);
			}
		}
		// 再对sign相邻位做差
		// 保存极大值和极小值的位置
		List<Integer> indMax = new ArrayList<Integer>();
		List<Integer> indMin = new ArrayList<Integer>();
		for (int j = 1; j < sign.size(); j++) {
			int diff = sign.get(j) - sign.get(j - 1);
			if (diff < 0) {
				indMax.add(j);
			} else if (diff > 0) {
				indMin.add(j);
			}
		}
		System.out.println("极大值为:");
		for (int m = 0; m < indMax.size(); m++) {
			System.out.print(num[indMax.get(m)] + " ");
		}
		System.out.println();
		System.out.println("极小值为:");
		for (int n = 0; n < indMin.size(); n++) {
			System.out.print(num[indMin.get(n)] + " ");
		}
	}

	public static void main(String[] args) {
		int a[] = { 1, 2, 10, 2, 4, 1, 8, 10, 23, 0 };
		findPeaks(a, 10);
	}
}