vector<int> searchRange(int A[], int n, int target) { int low = binarySearchLowBound(A, n, target); int upper = binarySearchUpperBound(A, n, target); if(low == n || A[low] != target){ return vector<int> {-1, -1}; }else{ return vector<int> {low, upper - 1}; } }
vector<int> searchRange(int A[], int n, int target) { vector<int> res( 2, -1 ); if( !A || n < 1 ) return res; int lower = binarySearchLowerBound( A, n, target ); int upper = binarySearchUpperBound( A, n, target ); if( lower <= upper ) { res[0] = lower; res[1] = upper; } return res; }