Find Minimum in Rotated Sorted Array（java实现）

最新推荐文章于 2024-10-08 10:36:00 发布

qq_441467816

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量194

点赞数 1

文章标签： leetcode java

本文链接：https://blog.csdn.net/qq_35135923/article/details/85875830

版权

Find Minimum in Rotated Sorted Array（java实现）

[题目描述]
(https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)

class Solution {
   public int findMin(int [] nums){
		int start =0,end = nums.length -1;
		if(nums[start] > nums[end]){
			while(start != end-1){
				int mid = start + (end - start)/2;
				if(nums[mid] > nums[end]){
					start = mid + 1;	
				}else
			end = mid - 1;
			}
		return Math.min(nums[start], nums[end]);
		}
		return nums[0];
	}
}