[LeetCode] Find Minimum in Rotated Sorted Array
来源:互联网 发布:vb中len函数的使用方法 编辑:程序博客网 时间:2024/06/08 08:37
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.
其实这道题是求旋转数组中的最小值的,将有序数组绕某点旋转,得到旋转数组,所以最后的数组前后两半部分都是各自有序的,那么怎么得到最小值呢?《剑指offer 名企面试
官精讲典型编程题》中是用二分查找的。
class Solution: # @param {integer[]} nums # @return {integer} def findMin(self, nums): head = 0 end = len(nums) - 1 if nums[head] <= nums[end]: return nums[head] while head <= end: mid = (head + end) >> 1 if end - head == 1: return nums[end] if nums[mid] > nums[head]: head = mid elif nums[mid] < nums[end]: end = mid
0 0
- [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
- LeetCode:Find Minimum in Rotated Sorted Array
- CKEditor实现图片上传
- 组合博弈 -- 三大基本博弈
- JavaScript中”立即调用的函数表达式“
- 关于ListView的初步使用
- 开始刷题leetcode day3: Majority Element
- [LeetCode] Find Minimum in Rotated Sorted Array
- android面试の通过Intent传递一些二进制数据的方法有哪些
- Vendor推薦可逆的加密方式
- Step into MongoDB - 15 - GridFS
- Android的Log输出新包装
- ValueError: operands could not be broadcast together with shapes (3000,20) (20,20)
- android启动过程
- 如何给标签增加圆形边缘
- CKeditor 配置使用