zoukankan      html  css  js  c++  java
  • Find Peak Element

    Find Peak Element

    问题:

    A peak element is an element that is greater than its neighbors.

    Given an input array 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] = -∞.

    For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number 2.

    思路:

      二分查找

    我的思路:

    public class Solution {
        public int findPeakElement(int[] num) {
            if(num == null || num.length == 0) return -1;
            int len = num.length;
            if(len == 1 || num[0] > num[1]) return 0;
            if(num[len - 1] > num[len - 2]) return len - 1;
            int left = 1;
            int right = len - 2;
            return getPeakIndex(num, left, right);
            
        }
        public int getPeakIndex(int[] num, int left, int right)
        {
            if(left > right) return -1;
            if(left == right)
            {
                if(num[left] > num[left - 1] && num[left] > num[left + 1]) return left;
                else return -1;
            }
            int mid = (left + right)/2;
            if(num[mid] > num[mid - 1] && num[mid] > num[mid + 1])  return mid;
            int index = getPeakIndex(num, left, mid - 1);
            if(index == -1)
                index = getPeakIndex(num, mid + 1, right);
            return index;
        }
        
        
    }
    View Code

    改进后算法:

    public class Solution {
        public int findPeakElement(int[] num) {
            if(num == null || num.length == 0) return -1;
            int len = num.length;
            if(len == 1) return 0;
            int left = 0;
            int right = len - 1;
            while(left <= right)
            {
                int mid = (left + right)/2;
                if(mid == 0)
                {
                    if(num[mid] > num[mid+1])   return mid;
                }
                else if(mid == len - 1)
                {
                    if(num[mid] > num[mid-1])   return mid;
                }
                else
                {
                    if(num[mid] > num[mid-1] && num[mid] > num[mid+1]) return mid;
                }
                if(num[mid] < num[mid+1]) left = mid + 1;
                else right = mid - 1 ;
            }
            return -1;
            
        }
    }
    View Code
    他人代码:
    class Solution {
    public:
        int findPeakElement(const vector<int> &num) {
            int left=0,right=num.size()-1;
            while(left<=right){
                if(left==right)
                    return left;
                int mid=(left+right)/2;
                if(num[mid]<num[mid+1])
                    left=mid+1;
                else
                    right=mid;
            }
        }
    };
    View Code

    回来用模板写的代码:

        public int findPeak(int[] A) {
            int[] num = A;
            if(num == null || num.length == 0) return -1;
            int len = num.length;
            if(len == 1) return 0;
            int left = 0;
            int right = len - 1;
            while(left + 1 < right)
            {
                int mid = (left + right)/2;
                if(mid == 0)
                {
                    if(num[mid] > num[mid+1])   return mid;
                }
                else if(mid == len - 1)
                {
                    if(num[mid] > num[mid-1])   return mid;
                }
                else
                {
                    if(num[mid] > num[mid-1] && num[mid] > num[mid+1]) return mid;
                    if(num[mid] < num[mid+1]) left = mid + 1;
                    else right = mid ;
                }
            }
            return num[left]>num[right] ? left:right;
        }
    View Code

    学习之处:

    • 首先肯定存在peak点,因为最左侧num[-1]=num[n]=负无穷大,肯定存在一个Peak
    • 若中间点不是peak,则分别朝着左右两侧上升的地方走
    • 左右left和right,都往着上升的地方走,相遇的地方就是peak点(这个有点难理解啊),没证明出来,但是一想是这么一回事
  • 相关阅读:
    jmeter测试接口--form表单提交请求(解决请求传参为空的问题)
    jmeter测试接口-打开很多TCP的连接数TIME_WAIT状态(Linux环境)导致报错的解决方法
    Jmeter 事务下的if控制器和无事务下的if控制器是否有不同 (业务实现3:2的补充)
    Jmeter if控制器的使用
    Jmeter 文件格式的参数化
    CentOS7学习笔记--tomcat9环境安装
    CentOS7学习笔记--PHP环境安装
    CentOS学习笔记—启动、ROOT密码
    虚拟机硬盘扩容
    win7如何设置某个软件不弹出用户账户控制
  • 原文地址:https://www.cnblogs.com/sunshisonghit/p/4319322.html
Copyright © 2011-2022 走看看