leetcode 33.Search in Rotated Sorted Array
来源:互联网 发布:乐其网络上海墨灿游戏 编辑:程序博客网 时间:2024/06/05 06:39
二分
题意:
一个有序数组,循环右移了若干位.
问这个数组里是否有某个值.
思路:
如果只是O(n)扫一遍,那你根本不用管什么升序降序的.
要O(logn)的算法,可以用二分.
注意到右移之外,数组从最左往右是递增的(某个范围内),从最右往左则是递减的,而我们要找到的是最大和最小的那个边界.
二分的时候,如果那个值比左端点大则移动左端点,否则移动右端点,最后就会得到那个分割点.
得到真正的数组开头,接下来再二分一次就行了.
总结:
先二分得到原数组开头,再二分查找.
0 0
- [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
- 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
- POJ3071 概率DP
- xcode不能进行智能提示
- 鼠标滑过图片悬停效果
- Eclipse新建类的时候如何自动添加注释(作者,时间,版本等信息)
- opengl skybox shader xyww
- leetcode 33.Search in Rotated Sorted Array
- WireShark 网络包过滤
- [CS231n@Stanford] Assignment1-Q5 (python) features实现
- centos下使用cdb_mydumper手动备份与恢复mysql
- 安卓学习笔记之Android消息机制
- 连接数据库的工具类
- Java中的运算符
- Android性能优化典例
- Ubuntu 安装mysql和简单操作