Leetcode Çözümleri | Find Minimum in Rotated Sorted Array
Leetcode içerisinde bulunan "Find Minimum in Rotated Sorted Array" sorusunun açıklaması ve çözümü. Bu soruda size sıralı olan bir dizinin n adet rotate edilmesiyle oluşan yeni bir dizideki en küçük elemanı döndürmeniz isteniyor.
Soruyu O(log n) zamanında çözmeniz isteniyor ayrıca.
#leetcode #csharp #programming
➡️ Leetcode 153. Find Minimum in Rotated Sorted Array: https://leetcode.com/problems/find-mi...
00:00 | Giriş
00:06 | Sorunun açıklaması
03:18 | Whiteboard üzerinde açıklanması
08:04 | Çözümün kodlanması
➡️ Problem açıklaması:
Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:
[4,5,6,7,0,1,2] if it was rotated 4 times.
[0,1,2,4,5,6,7] if it was rotated 7 times.
Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].
Given the sorted rotated array nums of unique elements, return the minimum element of this array.
You must write an algorithm that runs in O(log n) time.
Example 1:
Input: nums = [3,4,5,1,2]
Output: 1
Explanation: The original array was [1,2,3,4,5] rotated 3 times.
Example 2:
Input: nums = [4,5,6,7,0,1,2]
Output: 0
Explanation: The original array was [0,1,2,4,5,6,7] and it was rotated 4 times.
Example 3:
Input: nums = [11,13,15,17]
Output: 11
Explanation: The original array was [11,13,15,17] and it was rotated 4 times.
Constraints:
n == nums.length
1 lessEqual n lessEqual 5000
-5000 lessEqual nums[i] lessEqual 5000
All the integers of nums are unique.
nums is sorted and rotated between 1 and n times.
***
Sosyal Medya
🐦 Twitter'dan takip edin: / sonergonul
💜 Twitch'ten takip edin: / sonergonul
💚 Discord kanalımız: / discord
💖 Quora'dan takip edin: https://www.quora.com/profile/Soner-G...
💛 Instagram'dan takip edin: / sonergonul
Destek
💪 ByNoGame: https://www.bynogame.com/destekle/son...
💪 Stremlabs: https://streamlabs.com/sonergonul/tip