Update sortedLastIndex.md
This commit is contained in:
@ -3,16 +3,14 @@
|
|||||||
Returns the highest index at which value should be inserted into array in order to maintain its sort order.
|
Returns the highest index at which value should be inserted into array in order to maintain its sort order.
|
||||||
|
|
||||||
Check if the array is sorted in descending order (loosely).
|
Check if the array is sorted in descending order (loosely).
|
||||||
Use `Array.map()` to map each element to an array with its index and value.
|
|
||||||
Use `Array.reverse()` and `Array.findIndex()` to find the appropriate last index where the element should be inserted.
|
Use `Array.reverse()` and `Array.findIndex()` to find the appropriate last index where the element should be inserted.
|
||||||
|
|
||||||
```js
|
```js
|
||||||
const sortedLastIndex = (arr, n) => {
|
const sortedLastIndex = (arr, n) => {
|
||||||
const isDescending = arr[0] > arr[arr.length - 1];
|
const isDescending = arr[0] > arr[arr.length - 1];
|
||||||
const index = arr
|
const index = arr
|
||||||
.map((val, i) => [i, val])
|
|
||||||
.reverse()
|
.reverse()
|
||||||
.findIndex(el => (isDescending ? n <= el[1] : n >= el[1]));
|
.findIndex(el => (isDescending ? n <= el : n >= el));
|
||||||
return index === -1 ? 0 : arr.length - index - 1;
|
return index === -1 ? 0 : arr.length - index - 1;
|
||||||
};
|
};
|
||||||
```
|
```
|
||||||
|
|||||||
Reference in New Issue
Block a user