递增可重复数组中求一个数下标最大值(时间复杂度O(lgn))---C++实现

int arr[] = {1,2,3,3,4,4,4,5} 求4的下标 返回6
int arr[] = {1,2,3,3,4,4,4,5} 求3的下标 返回3
int arr[] = {1,2,3,3,4,4,4,5} 求7的下标 返回-1

int getMaxLoc(int* arr, int len, int target) {
	if (arr && len) {
		int res = -1;
		int begin = 0;
		int end = len-1;
		while (begin <= end) {
			int mid = (begin + end) / 2;
			if (arr[mid] == target) {
				res = mid;
				begin = mid + 1;
			}
			else if (arr[mid] < target) {
				begin = mid + 1;
			}
			else {
				end = mid - 1;
			}
		}
		return res;
	}
	return -1;
}