Leetcode 33. Search in Rotated Sorted Array (Hard) (java)
来源：互联网 发布：ffmpeg基础库编程开发 编辑：程序博客网 时间：2024/06/06 08:37
Leetcode 33. Search in Rotated Sorted Array (Hard) (java)
Tag: Array, Binary Search
Difficulty: Hard
public class Solution {public int search(int[] nums, int target) {int l = 0, r = nums.length - 1;while (l <= r) {int mid = l + (r - l) / 2;if (nums[mid] == target) {return mid;}else if (nums[l] <= nums[mid]) {if (nums[l] <= target && target < nums[mid]) {r = mid - 1;}else {l = mid + 1;}}else {if (nums[mid] < target && target <= nums[r]) {l = mid + 1;}else {r = mid - 1;}}}return -1;}}
0 0
- Leetcode 33. Search in Rotated Sorted Array (Hard) (java)
- Leetcode 33. Search in Rotated Sorted Array (Hard) (cpp)
- [LeetCode] 033. Search in Rotated Sorted Array (Hard) (C++)
- [Leetcode 33, Hard] Search in Rotated Sorted Array
- [Leetcode] Search in Rotated Sorted Array (Java)
- [LeetCode][Java] Search in Rotated Sorted Array
- LeetCode : Search in Rotated Sorted Array [java]
- Search in Rotated Sorted Array leetcode java
- [LeetCode]33.Search in Rotated Sorted Array
- LeetCode --- 33. Search in Rotated Sorted Array
- LeetCode 33.Search in Rotated Sorted Array
- [Leetcode] 33. Search in Rotated Sorted Array
- Leetcode-33.Search in Rotated Sorted Array.
- [leetcode] 33. Search in Rotated Sorted Array
- Leetcode 33. Search in Rotated Sorted Array
- [LeetCode]33. Search in Rotated Sorted Array
- leetcode 33. Search in Rotated Sorted Array
- LeetCode *** 33. Search in Rotated Sorted Array
- Windows注册表内容详解
- 第四周项目二长方形周长面积
- 我的第三个C语言：计算两个电阻的并联电阻。
- Tree Traversals Again(mooc 浙大算法课）
- 第四周项目2长方形面积
- Leetcode 33. Search in Rotated Sorted Array (Hard) (java)
- SpringMVC构建REST接口:第七篇 控制层实现
- 拷贝构造函数的调用场景和匿名对象的去留问题
- CI框架教程2——优化文件上传方法以及实现多文件上传
- 网卡驱动tips
- 指针获取二维数组中的首元素地址
- CCRepeatForever && CCSequence
- 0037-java.net.SocketException: No buffer space available (maximum connections reached?): JVM_Bind
- 排列习题
