https://leetcode.com/problems/find-in-mountain-array/ 题意:给定一个MountainArray(定义见题目),找到其中最早出现的target值的下标。 MountainArray.get() 函数调用不能超过100次。 解法:首先使用Binary Search找到mountain的peak,将array分为一个严格递增和一个严格递减的array,然后使用Binary Search。 classSolutio...
0804-Unique-Morse-Code-Words 0805-Split-Array-With-Same-Average 0806-Number-of-Lines-To-Write-String 0807-Max-Increase-to-Keep-City-Skyline 0809-Expressive-Words 0811-Subdomain-Visit-Count 0817-Linked-List-Components 0819-Most-Common-Word 0841-Keys-and-Rooms 0852-Pea...
[LeetCode] 35. Search Insert Position_Easy tag: Binary Searchfirst index >= target, without duplicates [LeetCode] 278. First Bad Version_Easy tag: Binary Searchfirst index, without duplicates [LeetCode] 162. Find Peak Element(852. Peak Index in a Mountain Array)_Medium tag: Binary Search ...
leetcode-222-Counter Complete Binary Tree Nodes - binary search 2 0 10:00 App leetcode-852. Peak Index in a Mountain Array -binary-search 94 0 10:30 App leetcode-1973-Count Nodes Equal to Sum of Descendants - Recursion 3 0 15:08 App leetcode-111. Minimum Depth of Binary Tree -...
[6210. 最小化数组中的最大值](https://leetcode.cn/problems/minimize-maximum-of-array/) 第五部分 SortedList + 二分 493.翻转对 315.计算右侧小于当前元素的个数 1847.最近的房间 2179.统计数组中好三元组数目 1713.得到子序列的最少操作次数 [327. 区间和的个数](https://leetcode.cn/problems/coun...
704. Binary Searchleetcode.com/problems/binary-search/ Solution 1 class Solution { public: int search(vector<int>& nums, int target) { int lo = 0, hi = nums.size() - 1; while (lo < hi) { int mid = lo + hi >> 1; if (nums[mid] >= target) hi = mid; else lo = mi...
1091-shortest-path-in-binary-matrix 1092-maximum-difference-between-node-and-ancestor 1095-find-in-mountain-array 1097-stream-of-characters 1099-path-with-maximum-minimum-value 11-container-with-most-water 110-balanced-binary-tree 1105-uncrossed-lines 1107-minimum-swaps-to-group-all-1s-together 111...
classSolution{public:intpeakIndexInMountainArray(vector<int>& A){intlength = A.size();intleft =0, rigth = length -1;intmid =0, current =0;while(left <= rigth) { mid = (left + rigth) /2;if(A[mid -1] < A[mid] && A[mid] > A[mid +1]) ...
Check If a Number Is Majority Element in a Sorted Array Dylan_Java_NYC 2019-12-21 10:48 阅读:867 评论:0 推荐:0 LeetCode 852. Peak Index in a Mountain Array Dylan_Java_NYC 2019-12-21 09:43 阅读:241 评论:0 推荐:0 LeetCode 540. Single Element in a Sorted Array Dylan_Java...
0804-Unique-Morse-Code-Words 0805-Split-Array-With-Same-Average 0806-Number-of-Lines-To-Write-String 0807-Max-Increase-to-Keep-City-Skyline 0809-Expressive-Words 0811-Subdomain-Visit-Count 0817-Linked-List-Components 0819-Most-Common-Word 0841-Keys-and-Rooms 0852-Peak-Ind...