首页 > 代码库 > LeetCode Find Minimum in Rotated Sorted Array
LeetCode Find Minimum in Rotated Sorted Array
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.
1 public class Solution { 2 public int findMin(int[] num) { 3 if (num.length==0) { 4 return 0; 5 } 6 int minnum=num[0]; 7 for (int i : num) { 8 if (i<minnum) { 9 minnum=i;10 break;11 }12 }13 return minnum;14 }15 }
LeetCode Find Minimum in Rotated Sorted Array
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。