升序降序数组查找最大值

折半查找变种算法实现

public class Main {

	public static void main(String[] args) {
		int[] attr = { 1, 2, 3, 5, 9, 6, 4 };
		System.out.println(find(attr));
	}

	public static int find(int[] attr) {
		int s = 0;
		int e = attr.length;
		while (s <= e) {
			int m = (s + e) / 2;
			if (m == s || m == e - 1) {
				return m;
			}
			if (attr[m] >= attr[m - 1] && attr[m] >= attr[m + 1]) {
				return m;
			} else if (attr[m] < attr[m - 1]) {
				e = m - 1;
			} else if (attr[m] > attr[m - 1]) {
				s = m + 1;
			}
		}
		return -1;
	}
}