@@ -18,53 +18,38 @@ return [3, 4].
1818 * Note: The returned array must be malloced, assume caller calls free().
1919 */
2020int * searchRange (int * nums , int numsSize , int target , int * returnSize ) {
21- int i , j , * range ;
22- int start , end , mid ;
23- 24- range = malloc (2 * sizeof (int ));
25- //assert(range);
26- 27- * returnSize = 2 ;
28- range [0 ] = range [1 ] = -1 ;
29- 30- #if 0
31- // O(n2)
32- for (i = 0 ; i < numsSize ; i ++ ) {
33- if (range [0 ] == -1 ) {
34- if (nums [i ] == target ) {
35- range [0 ] = range [1 ] = i ;
36- } else if (nums [i ] > target ) {
37- break ;
38- }
39- } else if (nums [i ] == target ) {
40- range [1 ] = i ;
41- } else {
42- break ;
43- }
44- }
45- #else
46- i = -1 ;
47- start = 0 ; end = numsSize - 1 ;
48- while (i == -1 && start <= end ) {
49- mid = start + (end - start ) / 2 ;
50- if (nums [mid ] == target ) {
51- i = j = mid ;
52- } else if (nums [mid ] < target ) {
53- start = mid + 1 ;
54- } else {
55- end = mid - 1 ;
56- }
57- }
58- while (i >= 0 && nums [i ] == target ) {
59- range [0 ] = i ;
60- i -- ;
61- }
62- while (j >= 0 && j < numsSize && nums [j ] == target ) {
63- range [1 ] = j ;
64- j ++ ;
65- }
66- #endif
67- return range ;
21+ int i , j , * range ;
22+ int start , end , mid ;
23+ 24+ range = malloc (2 * sizeof (int ));
25+ //assert(range);
26+ 27+ i = j = -1 ;
28+ start = 0 ; end = numsSize - 1 ;
29+ while (start <= end ) {
30+ mid = start + (end - start ) / 2 ;
31+ if (nums [mid ] == target ) {
32+ i = j = mid ;
33+ while (i > 0 && nums [i - 1 ] == target ) {
34+ i -- ;
35+ }
36+ while (j < numsSize - 1 && nums [j + 1 ] == target ) {
37+ j ++ ;
38+ }
39+ break ;
40+ } else if (nums [mid ] < target ) {
41+ start = mid + 1 ;
42+ } else {
43+ end = mid - 1 ;
44+ }
45+ }
46+ 47+ range [0 ] = i ;
48+ range [1 ] = j ;
49+ 50+ * returnSize = 2 ;
51+ 52+ return range ;
6853}
6954
7055
0 commit comments