Search in Rotated Sorted Array II
来源:互联网 发布:舒淇演技 知乎 编辑:程序博客网 时间:2024/04/29 07:01
题目要求:
二分查找被旋转的有序数组(允许数组元素重复),找到返回true,如果不存在待查找数便返回false。
例子:
特殊情况如:
(1、4、1、1、1、1、1) 查找3返回true;
(1、1、1、1、1、4、1) 查找3返回true;
代码:
#include<stdafx.h>#include <iostream>using namespace std;class Solution {public:bool searchInsert(int A[], int n, int target) {int low=0;int cur=(n-1)/2;int high=n-1;while(low<=high) { int cur= (low+high)/2; if(target == A[cur]) return true; if(A[cur]<=A[high]) { if(target<=A[high] && target>A[cur]) low = cur+1; else high = cur-1; } else { if(target>=A[low] && target<A[cur]) high = cur-1; else low = cur+1; } } return false; }};void main(){int A[9]={4,4,5,6,7,0,0,1,2};Solution s;cout<<s.searchInsert(A,9,4)<<endl;getchar();}
0 0
- LeetCode: Search in Rotated Sorted Array II
- 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
- Search in Rotated Sorted Array II
- [leetcode] Search in Rotated Sorted Array II
- [LeetCode]Search in Rotated Sorted Array II
- Search in Rotated Sorted Array II
- Search in Rotated Sorted Array II
- Search in Rotated Sorted Array II
- Search in Rotated Sorted Array II
- [leetcode] Search in Rotated Sorted Array II
- LeetCode-Search in Rotated Sorted Array II
- Search in Rotated Sorted Array II
- LeetCode - Search in Rotated Sorted Array II
- 【Leetcode】Search in Rotated Sorted Array II
- CCS使用
- C语言之typedef的使用
- Sqlite3 命令
- 分布式事物TransactionScope的正确用法
- hdu1047(模拟大数循环相加)
- Search in Rotated Sorted Array II
- Java 学习 第四章 我们来找错-Java异常处理
- jsp中<%%> 与<%!%> , <%%>与<%=%>的区别是什么?
- java方法返回值的变量类型困惑
- 黑马程序员:OC学习日记之Foundation
- 统计web访问前10的ip
- 【Android 应用开发】 自定义 圆形进度条 组件
- Activity的四种启动模式
- CCS新建工程以及下载程序