题目描述

Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e.,0 1 2 4 5 6 7might become4 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.

class Solution {
public:int search(int A[], int n, int target) {int l = 0;int h = n-1;while(l <= h){int m = (l + h) / 2;if(A[m] == target)return m;else if(A[m] <= A[h]){if(A[m] < target && target <= A[h])l = m + 1;elseh = m - 1;}else{if(A[m] > target && target >= A[l])h = m - 1;elsel = m + 1;}}return -1;}
};

leetcode---search-in-rotated-sorted-array---查找相关推荐

  1. LeetCode Search in Rotated Sorted Array II -- 有重复的旋转序列搜索

    Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...

  2. LeetCode Search in Rotated Sorted Array II

     Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would t ...

  3. leetcode - Search in Rotated Sorted Array II

    Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...

  4. leetcode:Search in Rotated Sorted Array

    题目要求: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 ...

  5. [leetcode]Search in Rotated Sorted Array @ Python

    原题地址:https://oj.leetcode.com/problems/search-in-rotated-sorted-array/ 题意: Suppose a sorted array is ...

  6. [leetcode]Search in Rotated Sorted Array II

    这道题目仍然是二分,去掉不可能的部分.用了递归,在重复的情况下,就是有可能最左边的和最右边的相等,此时就不能直接判断出区间外的元素,左右两边同时递归.有重复元素的时候,在bad case的时候会退化为 ...

  7. [LeetCode] Search in Rotated Sorted Array

    二分 : 判断条件 当a[left] <= a[mid]时,可以肯定a[left..mid]是升序的 循环有序 一共有以下两种情况 第一种  / / / / / / 条件: (A[mid] &g ...

  8. Search in Rotated Sorted Array - 循环有序数组查找问题

    两道题 33. Search in Rotated Sorted Array https://leetcode.com/problems/search-in-rotated-sorted-array/ ...

  9. LeetCode 33. Search in Rotated Sorted Array

    问题链接 LeetCode 33. Search in Rotated Sorted Array 题目解析 给定一个 "升序" 的 无重复 数组,从中寻找目标值."升序& ...

  10. 【leetcode】Search in Rotated Sorted Array II(middle)☆

    Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...

最新文章

  1. DotNetCore跨平台~System.DrawingCore部署Linux需要注意的
  2. 计算机专业it职业英语作文,英文简历范文:计算机专业
  3. generator自动生成mybatis配置和类信息
  4. Java高并发编程:使用JDK5中同步技术的3个面试题
  5. Android进入商店并跳转到指定应用
  6. iOS活动倒计时的两种实现方式
  7. kali安装步骤失败 选择并安装软件_PhotoShop CS5中文版软件下载+安装详细步骤
  8. 简单python脚本实例-python脚本例子
  9. Bzoj4556 [Tjoi2016Heoi2016]字符串
  10. OAF_OAF Framework页面分析(概念)
  11. 配置管理——配置项标识
  12. 34. 丑数(C++版本)
  13. SCP-bzoj-1000
  14. moodle环境安装linux,在Ubuntu 18.04/Debian 9上安装Moodle的步骤
  15. 2021爱分析・区域性银行数字化实践报告
  16. Android连接大华条码秤区位码转换
  17. Xsens MVN Analyze高精度惯性动作捕捉系统Link版
  18. 腾讯云服务器IP地址绑定域名步骤
  19. 位置不可用——文件或目录损坏且无法读取
  20. 第6周作业1-闰年之循环判断(网络131黄宇倩)

热门文章

  1. 四位大小写字母和数字随机验证码
  2. 文献阅读(73)AAAI2022-SAIL: Self Augmented Graph Contrastive Learning
  3. 2019掘安杯原题复现
  4. 原来Oracle也不喜欢“蜀黍(r6笔记第54天)
  5. 京东第一位博士后出站 看看他研究的是什么“黑科技”
  6. bergerAimi
  7. 弘辽科技:如何查看淘宝直通车排名?对手竞价怎么看?
  8. Android跟我一起来开发--微影之架构补充篇
  9. ISO14443-3
  10. 【Netty之旅四】你一定看得懂的Netty客户端启动源码分析!