zoukankan      html  css  js  c++  java
  • Leetcode[154]-Find Minimum in Rotated Sorted Array II

    Link: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/

    Follow up for "Find Minimum in Rotated Sorted Array":
    What if duplicates are allowed?
    
    Would this affect the run-time complexity? How and why?

    Suppose a sorted array is rotated at some pivot unknown to you beforehand.

    (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

    Find the minimum element.

    The array may contain duplicates.


    C++:

    方法一:直接遍历求解

    class Solution {
    public:
        int findMin(vector<int>& nums) {
    
            int n = nums.size();
            int min = nums[0];
            for(int  i = 1; i < n; i++) {
                if(nums[i]<min){
                    min = nums[i];
                }
            }
            return min;
        }
    };
  • 相关阅读:
    Uva
    Uva
    Uva
    Uva
    Uva
    Uva
    Uva
    Uva
    第二次结队编程作业
    第三次软件工程作业的总结
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/5176233.html
Copyright © 2011-2022 走看看