题解 | #下一个排列#

class Solution {
public:
/*
*
* @param A int整型一维数组
* @param n int A数组长度
* @param target int整型
* @return int整型vector
*/
vector<int> searchRange(int</int> A, int n, int target) {
int l = lower_bound(A, A + n, target) - A;
int r = upper_bound(A, A + n, target) - A;
if(l == n || A[l] != target)
return {-1, -1};
return {l, r - 1};
}
};