Description:
Solution:
Brute force method is not adapted as a solution.
We are gonna make the pointer end of both array.
Shift l if height[l] is smaller than height[r].
Else: shift r to right.
'LeetCode ๐๏ธ > Array' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
| 15. 3Sum (0) | 2023.05.31 |
|---|---|
| 33. Search in Rotated Sorted Array (0) | 2023.05.30 |
| 153. Find Minimum in Rotated Sorted Array (0) | 2023.05.29 |
| 152. Maximum Product Subarray (0) | 2023.05.28 |
| 53. Maximum Subarray (0) | 2023.05.27 |
