LeetCode(力扣)——Search in Rotated Sorted Array 搜索旋转排序数组 python实现
2020-02-12 13:40
519 查看
题目描述:
python实现 Search in Rotated Sorted Array 搜索旋转排序数组
中文:假设按照升序排序的数组在预先未知的某个点上进行了旋转。
( 例如,数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。
搜索一个给定的目标值,如果数组中存在这个目标值,则返回它的索引,否则返回 -1 。
你可以假设数组中不存在重复的元素。
你的算法时间复杂度必须是 O(log n) 级别。
英文:Suppose an array sorted in ascending order 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]).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
Your algorithm's runtime complexity must be in the order of O(log n).
1 class Solution(object): 2 def search(self, nums, target): 3 """ 4 :type nums: List[int] 5 :type target: int 6 :rtype: int 7 """ 8 start = 0 9 end = len(nums)-1 10 while start<=end: 11 mid = (start + end)/2 #对于整数会自动省去小数部分 12 if nums[mid] == target: 13 return mid 14 if nums[mid]>=nums[start]: 15 if target >= nums[start] and target<=nums[mid]: 16 end = mid-1 17 else: 18 start = mid + 1 19 20 if nums[mid]<nums[end]: 21 if target > nums[mid] and target<=nums[end]: 22 start = mid+1 23 24 else: 25 end = mid -1 26 return -1
题目来源:力扣题库
转载于:https://www.cnblogs.com/spp666/p/11536041.html
- 点赞
- 收藏
- 分享
- 文章举报
相关文章推荐
- 【LeetCode-面试算法经典-Java实现】【081-Search in Rotated Sorted Array II(搜索旋转的排序数组)】
- 【leetcode】(python) 33. Search in Rotated Sorted Array搜索旋转排序数组详解
- 【LeetCode-面试算法经典-Java实现】【033-Search in Rotated Sorted Array(在旋转数组中搜索)】
- LeetCode 33 Search in Rotated Sorted Array(在旋转排序数组中搜索)(*)
- 【LeetCode-面试算法经典-Java实现】【033-Search in Rotated Sorted Array(在旋转数组中搜索)】
- leetcode 刷题之路 35 Search in Rotated Sorted Array II (旋转排序数组查找终极版)
- leetcode 33.Search in Rotated Sorted Array 旋转数组二分查找法搜索
- [Leetcode] search in rotated sorted array 搜索旋转有序数组
- leetCode 33.Search in Rotated Sorted Array(排序旋转数组的查找) 解题思路和方法
- [Lintcode] Search in Rotated Sorted Array II 搜索旋转排序数组 II
- LeetCode 33. Search in Rotated Sorted Array(旋转数组搜索)
- 线性表--搜索旋转排序数组(Search in Rotated Sorted Array)
- [LeetCode] 81. Search in Rotated Sorted Array II 在旋转有序数组中搜索 II
- leetcode题解:Search in Rotated Sorted Array(旋转排序数组查找)
- LeetCode-Search in Rotated Sorted Array II-在旋转数组中搜索-二分查找
- leetcode 题解:Search in Rotated Sorted Array II (旋转已排序数组查找2)
- 线性表--搜索旋转排序数组 II(Search in Rotated Sorted Array II)
- leetCode 81.Search in Rotated Sorted Array II (旋转数组的搜索II) 解题思路和方法
- [LintCode] 搜索旋转排序数组 Search in Rotated Sorted Array
- [Lintcode] 搜索旋转排序数组 II Search in Rotated Sorted Array II