Search for a Range - LeetCode

Given a sorted array of integers, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

这道题使用了二分的算法，以下是二分的函数：

public int binary_search(int[] A, int len, int goal)
	{
	    int low = 0;
	    int high = len - 1;
	    while(low <= high)
	    {
	        int middle = (low + high)/2;
	        if(A[middle] == goal)
	            return middle;
	        else if(A[middle] > goal)
	            high = middle - 1;
	        else
	            low = middle + 1;
	    }
	    return -1;
	}

以下是我借鉴的AC的代码。我其实一直不太明白什么叫做in order of log(n)。因为我看到的别人的算法和自己想的算法都是O(logn + k)。其中K是这个target可能重复的次数。所以这种符合 in order of log(n)？

class Solution {
public:
   vector<int> searchRange(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int begin = 0;
		int end = n-1;
		int index = -1;
		vector<int> res;
		while(begin < end)
		{
			int mid = (begin+end)/2;
			if(A[mid] == target){index = mid; break;}
			else if(target < A[mid])
				end = mid-1;
			else
				begin = mid+1;
		}
		if(begin==end && A[begin]==target)
			index = begin;
		if(index == -1)
		{
			res.push_back(-1);
			res.push_back(-1);
			return res;
		}else{
			begin = index;
			while(begin >=0 && A[begin]==target)begin--;
			begin++;
			end = index;
			while(end < n && A[end]==target)end++;
			end--;
			res.push_back(begin);
			res.push_back(end);
			return res;
		}
    }
};