-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindFirstAndLastPositionOfElementInSortedArray.php
More file actions
58 lines (55 loc) · 1.47 KB
/
Copy pathFindFirstAndLastPositionOfElementInSortedArray.php
File metadata and controls
58 lines (55 loc) · 1.47 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
<?php
namespace App;
/**
* Find First and Last Position of Element in Sorted Array
*
* Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given
* target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime
* complexity.
*
* Example 1:
* Input: nums = [5,7,7,8,8,10], target = 8
* Output: [3,4]
*
* Example 2:
* Input: nums = [5,7,7,8,8,10], target = 6
* Output: [-1,-1]
*
* Example 3:
* Input: nums = [], target = 0
* Output: [-1,-1]
*
* https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array
*/
class FindFirstAndLastPositionOfElementInSortedArray
{
/**
* @param int[] $nums
* @param int $target
* @return int[]
*/
public function searchRange(array $nums, int $target): array
{
if (count($nums) === 1 && $target === $nums[0]) {
return [0, 0];
}
$first = $last = -1;
$left = 0;
$right = count($nums) - 1;
while (($left <= $right) && ($first === -1 || $last === -1)) {
if ($nums[$left] === $target) {
$first = $left;
}
if ($nums[$right] === $target) {
$last = $right;
}
if ($first === -1) {
$left++;
}
if ($last === -1) {
$right--;
}
}
return [$first, $last];
}
}