开始刷leetcode day11:Find Minimum in Rotated Sorted Array
来源:互联网 发布:mysql 查询某一年数据 编辑:程序博客网 时间:2024/06/05 18:53
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.
Java:
public class Solution {
public int findMin(int[] nums) {
if(nums.length == 0) return -1;
int min = nums[0];
int i=0;
while(i < nums.length -1 && nums[i] < nums[i+1] )
{
i++;
}
if(i== nums.length -1) return min;
return nums[i+1];
}
}
0 0
- 开始刷leetcode day11:Find Minimum in Rotated Sorted Array
- [LeetCode] Find Minimum in Rotated Sorted Array
- Leetcode: Find Minimum in Rotated Sorted Array
- leetcode :Find Minimum in Rotated Sorted Array
- LeetCode:Find Minimum in Rotated Sorted Array
- 【Leetcode】Find Minimum in Rotated Sorted Array
- LeetCode:Find Minimum in Rotated Sorted Array
- LeetCode: Find Minimum in Rotated Sorted Array
- leetcode: Find Minimum in Rotated Sorted Array
- [LeetCode] Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array -- LeetCode
- Leetcode: Find Minimum in Rotated Sorted Array
- leetcode Find Minimum in Rotated Sorted Array
- leetcode - Find Minimum in Rotated Sorted Array
- LeetCode Find Minimum in Rotated Sorted Array
- Leetcode--Find Minimum in Rotated Sorted Array
- leetcode: Find Minimum in Rotated Sorted Array
- [leetcode] Find Minimum in Rotated Sorted Array
- ddos云防御
- TP+UC+DZ同步登陆问题汇总
- 动态链接库的显示加载和隐式加载的区别
- 网站访问优化(二):开启apache服务器gzip压缩
- 第一个DLL程序:动态链接库DLL教程,30分钟快速上手
- 开始刷leetcode day11:Find Minimum in Rotated Sorted Array
- Eclipse代码格式化、规整化、自定义代码风格 Ctrl + shift + f
- 吴鉴鹰谈一个单片机初学者的傲慢与偏见
- HDU3584 Cube【树状数组】【三维】
- Openstack Nova Failed to allocate network(s)
- LinearLayout增加边框
- 解压vmlinuz和解压initrd(initramfs)
- Android Tween and Property Animation的本质区别
- codechef(MAY15)第二题Set Difference