1. 首页
  2. IT资讯

153. Find Minimum in Rotated Sorted Array

Problem Description:

Suppose an array sorted in ascending order 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.

You may assume no duplicate exists in the array.

Example 1:

 Input: [3,4,5,1,2]  Output: 1 

Example 2:

 Input: [4,5,6,7,0,1,2] Output: 0

Analysis:

本题利用了其旋转的特点,从后向前遍历找到第一个数值其小于后面一个值。代码如下:

Code:

 class Solution {     public int findMin(int[] nums) {         for(int i = nums.length - 2; i >= 0; i--) {             if(nums[i] > nums[i + 1]) {                 return nums[i + 1];             }         }         return nums[0];     } }

 

  • 点赞
  • 收藏
  • 分享

    • 文章举报

153. Find Minimum in Rotated Sorted Array 153. Find Minimum in Rotated Sorted Array
林下溪源
发布了145 篇原创文章 · 获赞 0 · 访问量 4万+

私信 关注

原文始发于:153. Find Minimum in Rotated Sorted Array

主题测试文章,只做测试使用。发布者:sys234,转转请注明出处:http://www.cxybcw.com/88716.html

联系我们

13687733322

在线咨询:点击这里给我发消息

邮件:1877088071@qq.com

工作时间:周一至周五,9:30-18:30,节假日休息

QR code