HackerRank
Search results
Find Peak Element - A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums [-1] = nums [n] = -∞.
May 10, 2016 · 162. Find Peak Element Description. A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is ...
162. Find Peak Element. Time: O (\log n) O(logn) Space: O (1) O(1) C++ Java Python. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17. class Solution { public: int findPeakElement(vector<int>& nums) { int l = 0; int r = nums.size() - 1; while (l < r) { const int m = (l + r) / 2; if (nums[m] >= nums[m + 1]) r = m; else l = m + 1; } return l; } };
162. Find Peak Element. Medium Array Binary Search. Leetcode Link. Problem Description. The problem presents an integer array called nums which is 0-indexed. We are tasked with finding an index of a peak element. A peak element is defined as an element that is strictly greater than its neighboring elements.
Find Peak Element. A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞.
Jul 13, 2021 · 162. Find Peak Element. Problem Description. A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞.
Can you solve this real interview question? Find Peak Element - Level up your coding skills and quickly land a job.
Given an input array nums, where num [i] ≠ num [i+1], find a peak element and return its index. The array may contain multiple peaks, in that case return the index to any one of the peaks is fine. You may imagine that num [-1] = num [n] = -∞. Example 1: Input: nums = [1, 2, 3, 1] Output: 2.
A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞.
162. 寻找峰值 - 峰值元素是指其值严格大于左右相邻值的元素。 给你一个整数数组 nums，找到峰值元素并返回其索引。数组可能包含多个峰值，在这种情况下，返回 任何一个峰值 所在位置即可。 你可以假设 nums[-1] = nums[n] = -∞ 。
