filmov
tv
LeetCode Çözümleri - 1299. Replace Elements with Greatest Element on Right Side
![preview_player](https://i.ytimg.com/vi/E4gDgtrljAM/maxresdefault.jpg)
Показать описание
LeetCode içerisinde bulunan "Replace Elements with Greatest Element on Right Side" sorusunun açıklaması ve çözümü. Bu soruda sizi verilen bir tam sayı dizisinde, her bir elemanı, sağındaki en büyük eleman ile replace etmenizi, son elemanı da -1'e atamanızı istiyor.
#leetcode #programming #coding
00:00 | Intro
00:15 | Sorunun açıklaması
04:32 | Çözümün kodlanması
08:24 | Outro
► Problem açıklaması:
Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -1.
After doing so, return the array.
Example 1:
Input: arr = [17,18,5,4,6,1]
Output: [18,6,6,6,1,-1]
Explanation:
- index 0 -- the greatest element to the right of index 0 is index 1 (18).
- index 1 -- the greatest element to the right of index 1 is index 4 (6).
- index 2 -- the greatest element to the right of index 2 is index 4 (6).
- index 3 -- the greatest element to the right of index 3 is index 4 (6).
- index 4 -- the greatest element to the right of index 4 is index 5 (1).
- index 5 -- there are no elements to the right of index 5, so we put -1.
Example 2:
Input: arr = [400]
Output: [-1]
Explanation: There are no elements to the right of index 0.
Constraints:
1 lessEqual arr[i] lessEqual 10^5
***
Sosyal Medya
Destek
#leetcode #programming #coding
00:00 | Intro
00:15 | Sorunun açıklaması
04:32 | Çözümün kodlanması
08:24 | Outro
► Problem açıklaması:
Given an array arr, replace every element in that array with the greatest element among the elements to its right, and replace the last element with -1.
After doing so, return the array.
Example 1:
Input: arr = [17,18,5,4,6,1]
Output: [18,6,6,6,1,-1]
Explanation:
- index 0 -- the greatest element to the right of index 0 is index 1 (18).
- index 1 -- the greatest element to the right of index 1 is index 4 (6).
- index 2 -- the greatest element to the right of index 2 is index 4 (6).
- index 3 -- the greatest element to the right of index 3 is index 4 (6).
- index 4 -- the greatest element to the right of index 4 is index 5 (1).
- index 5 -- there are no elements to the right of index 5, so we put -1.
Example 2:
Input: arr = [400]
Output: [-1]
Explanation: There are no elements to the right of index 0.
Constraints:
1 lessEqual arr[i] lessEqual 10^5
***
Sosyal Medya
Destek
Комментарии