81. Search in Rotated Sorted Array II LeetCode
来源:互联网 发布:有密软件 编辑:程序博客网 时间:2024/05/16 00:26
题意:在旋转数组中查找一个数,与之前不同的是旋转数组里面会有重复的数字出现。
题解:一样的套路,旋转之后的数组,要么是一段连续递增的,要么是两段,分情况讨论二分。
class Solution {public: bool search(vector<int>& nums, int target) { int l = 0,r = nums.size() - 1; while(l <= r) { int mid = (l + r) / 2; if(nums[mid] == target) return true; if(nums[l] < nums[mid]) { if(nums[l] <= target && nums[mid] > target) r = mid - 1; else l = mid + 1; } else if(nums[l] > nums[mid]) { if(nums[l] <= target || nums[mid] > target) r = mid - 1; else l = mid + 1; } else l++; } return false; }};
0 0
- leetcode题解-33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II
- LeetCode 33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II
- LeetCode: Search in Rotated Sorted Array II
- LeetCode Search in Rotated Sorted Array II
- LeetCode : Search in Rotated Sorted Array II
- [LeetCode] Search in Rotated Sorted Array II
- [Leetcode] Search in Rotated Sorted Array II
- [leetcode] Search in Rotated Sorted Array II
- [LeetCode]Search in Rotated Sorted Array II
- [leetcode] Search in Rotated Sorted Array II
- LeetCode-Search in Rotated Sorted Array II
- LeetCode - Search in Rotated Sorted Array II
- 【Leetcode】Search in Rotated Sorted Array II
- Leetcode: Search in Rotated Sorted Array II
- 【leetcode】Search in Rotated Sorted Array II
- leetcode Search in Rotated Sorted Array II
- Leetcode: Search in Rotated Sorted Array II
- [LeetCode] Search in Rotated Sorted Array II
- 操纵持久化对象
- hadoop集群环境搭建的血泪史
- POJ 1222 EXTENDED LIGHTS OUT(矩阵反转问题——枚举or高斯消元)
- Self summary: Ruby(RVM, gem, bundle)
- Java注解@Retention&@Inherited@Target@IntDef@Documented
- 81. Search in Rotated Sorted Array II LeetCode
- HttpURLConnection对象相关方法操作
- WPF中使用amCharts绘制股票K线图
- 理解android Matrix
- EditText支持多行同时支持imeOptions设置
- leetcode 6. ZigZag Conversion
- C语言-内存对齐
- AT&T格式汇编学习
- 面向对象设计6大原则之五(接口隔离原则)-系统有更高的灵活性