首页 > 代码库 > leetcode 153. Find Minimum in Rotated Sorted Array --------- java
leetcode 153. Find Minimum in Rotated Sorted Array --------- java
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.
You may assume no duplicate exists in the array.
在一个反转了的排好序的数组中，找出最小的数
可以直接寻找。
public class Solution { public int findMin(int[] nums) { if( nums.length == 1) return nums[0]; int result = nums[0]; for( int i = 1 ; i<nums.length;i++) result = Math.min(nums[i],result); return result; } }
二分查找。
public class Solution { public int findMin(int[] nums) { if( nums.length == 1) return nums[0]; int left = 0,right = nums.length-1; int mid = (left+right)/2; int first = nums[0]; while( left < right ){ if( nums[left] == nums[mid] ){ first = Math.min(Math.min(first,nums[left]),nums[right]); break; } else if( nums[left] < nums[mid] ){ left = mid; mid = (left+right)/2; first = Math.min(first,nums[left]); }else { right = mid; mid = (left+right)/2; first = Math.min(first,nums[mid]); } } return Math.min(first,nums[left]); } }
leetcode 153. Find Minimum in Rotated Sorted Array --------- java
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。