国产xxxx99真实实拍_久久不雅视频_高清韩国a级特黄毛片_嗯老师别我我受不了了小说

資訊專欄INFORMATION COLUMN

9 .leetcode Peak Index in a Mountain Array

txgcwm / 1492人閱讀

摘要：題目例子我的解法其他解法求最大值然后求二分法查找

1 題目

Let"s call an array A a mountain if the following properties hold:

A.length >= 3
There exists some 0 < i < A.length - 1 such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]
Given an array that is definitely a mountain, return any i such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1].

例子 
Input: [0,1,0]
Output: 1
Input: [0,2,1,0]
Output: 1
我的解法 
var peakIndexInMountainArray = function(A) {
     let i = 0
     while (i < A.length){
         if (A[i] > A[i+1]){
             break
            }
         i++
     }
    return i
};
Runtime: 60 ms, faster than 85.20% of JavaScript online submissions for Peak Index in a Mountain Array.
Memory Usage: 35 MB, less than 52.70% of JavaScript online submissions for Peak Index in a Mountain Array.
其他解法 
var peakIndexInMountainArray = function(A) {
    return A.indexOf(Math.max(...A));
};

求最大值然后求index

var peakIndexInMountainArray = function(A) {
  function mid(a,b) {
    return Math.floor((b-a)/2);
  } 

  let left = 0, right = A.length-1; 
  let pivot = mid(left, right);

  while ( A[pivot-1]>A[pivot] || A[pivot]A[pivot+1]) {
      right = pivot;
      pivot = mid(left, right)
    } else {
      left = pivot;
      pivot += mid(left, right)
    }
  }

  return pivot;
};

二分法查找

文章版權(quán)歸作者所有，未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請注明本文地址：http://specialneedsforspecialkids.com/yun/103537.html

相關(guān)文章

  • Leetcode PHP題解--D12 852. Peak Index in a Mountain

    摘要：題目鏈接題目分析這個(gè)題目比較簡單。要求返回?cái)?shù)組中最大值的索引。思路先用找到最大值，再用獲取最大值的索引。最終代碼若覺得本文章對你有用，歡迎用愛發(fā)電資助。 852. Peak Index in a Mountain Array 題目鏈接 852. Peak Index in a Mountain Array 題目分析 這個(gè)題目比較簡單。要求返回?cái)?shù)組中最大值的索引。 思路 先用max找到最...

    luffyZh 評論0 收藏0

  • [LeetCode] 852. Peak Index in a Mountain Array

    Problem Lets call an array A a mountain if the following properties hold: A.length >= 3There exists some 0 < i < A.length - 1 such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... > A[A.length - 1]...

    ispring 評論0 收藏0

  • [Lintcode] Find Peak Element 找峰值

    摘要：找出該矩陣的一個(gè)峰值元素，返回他的坐標(biāo)原題鏈接一維二分搜索復(fù)雜度時(shí)間空間思路最直觀的方法是遍歷整個(gè)矩陣，但這要的時(shí)間。 Find Peak Element I A peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], fi...

    leiyi 評論0 收藏0

  • [Leetcode] Find Minimum in Rotated Sorted Array 找旋

    摘要：二分迭代法復(fù)雜度時(shí)間空間遞歸棧空間思路找旋轉(zhuǎn)數(shù)組的起點(diǎn)，實(shí)際上類似找一個(gè)山谷，只要兩邊都比中間高就對了，這和這題很像。 Find Minimum in Rotated Sorted Array I Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 ...

    notebin 評論0 收藏0

  • [LeetCode] 702. Search in a Sorted Array of Unknow

    Problem Given an integer array sorted in ascending order, write a function to search target in nums. If target exists, then return its index, otherwise return -1. However, the array size is unknown t...

    zlyBear 評論0 收藏0

發(fā)表評論

0條評論

txgcwm

男|高級講師

TA的文章

閱讀更多
最新活動
閱讀需要支付1元查看
<