LeetCode 033 Search in Rotated Sorted Array
来源:互联网 发布:hello world程序python 编辑:程序博客网 时间:2024/06/05 10:33
题目描述
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
).
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.
代码
public int search(int[] nums, int target) { int l = 0, r = nums.length - 1; while (l <= r) { int m = (l + r) / 2; if (nums[m] == target) return m; if (nums[l] < nums[m]) { if (target <= nums[m] && target >= nums[l]) r = m - 1; else l = m + 1; } else if (nums[l] > nums[m]) { if (target >= nums[l] || target <= nums[m]) r = m - 1; else l = m + 1; } else l++; } return -1; }
1 0
- LeetCode 033 Search in Rotated Sorted Array
- 033 Search in Rotated Sorted Array[Leetcode]
- [LeetCode]033-Search In Rotated Sorted Array
- LeetCode 033 Search in Rotated Sorted Array
- leetcode 033 Search in Rotated Sorted Array
- leetcode 033 Search in Rotated Sorted Array
- LeetCode 033 Search in Rotated Sorted Array
- Leetcode-033 Search in Rotated Sorted Array
- [leetcode][search] Search in Rotated Sorted Array
- LeetCode: Search in Rotated Sorted Array
- LeetCode: Search in Rotated Sorted Array II
- LeetCode Search in Rotated Sorted Array
- LeetCode Search in Rotated Sorted Array II
- [Leetcode] Search in Rotated Sorted Array
- LeetCode : Search in Rotated Sorted Array
- LeetCode : Search in Rotated Sorted Array II
- [LeetCode] Search in Rotated Sorted Array II
- [LeetCode] Search in Rotated Sorted Array
- STL_算法_元素计数(count、count_if)
- nginx配置优化
- Jenkins配置问题汇总
- iOS开发简单的实现后台任务(诸如后台播放音乐,定时器等)
- FMDB 用法
- LeetCode 033 Search in Rotated Sorted Array
- C语言宏定义##连接符和#符的使用
- DOM操作-event触发顺序
- 我的Pycharm,我做主
- usrp 升级fpga引发的问题
- Android版添加phonegap---横竖屏锁定插件教程
- 自动化管理工具Saltstack之安装篇(1)
- 分布式与集群的联系与区别
- javascript预加载图片、css、js的方法研究