public class Solution {
/**
* @param num: a rotated sorted array
* @return: the minimum number in the array
*/
public int findMin(int[] num) {
// write your code here
int length = num.length;
int min = num[length - 1];
for (int i = 0; i < length; i++) {
if (num[i] < min) min = num[i];
}
return min;
}
}
Find Minimum in Rotated Sorted ArraySuppose an array sort...
Suppose a sorted array is rotated at some pivot unknown t...
- Find Minimum in Rotated Sorted Array it counts when it'...
ollow up for "Find Minimum in Rotated Sorted Array":What ...
Find Minimum in Rotated Sorted Array Suppose an array sor...
Follow up for "Find Minimum in Rotated Sorted Array":What...
Follow up for "Find Minimum in Rotated Sorted Array":What...
Find Minimum in Rotated Sorted Array Suppose an array sor...
本文标题：160.Find Minimum in Rotated Sort
本文链接：https://www.haomeiwen.com/subject/xggchxtx.html
网友评论