public static int lowerBound(int left, int right, long target)
{
while(left<right)
{
int mid = (left + right) / 2;
if(target <= arr[mid])
{
right = mid;
}
else
{
left = mid +1;
}
}
return left;
}
public static int upperBound(int left, int right, long target)
{
while(left<right)
{
int mid = (left + right) / 2;
if(target < arr[mid])
{
right = mid;
}
else
{
left = mid +1;
}
}
return left;
}'알고리즘 > 공식' 카테고리의 다른 글
| DP (0) | 2022.10.09 |
|---|---|
| Union-find (0) | 2022.09.25 |