题目内容

题目来源:LeetCode

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Write a function to determine if a given target is in the array.

The array may contain duplicates.

题目思路

本题难度:medium

这个题目是基于上一道题Search in Rotated Sorted Array改进的。在上一道题当中,nums[start]和nums[mid]的判断中,将<和=是联合在一起进行判断的。在本题当中,假如nums[start]==nums[mid],那么将start+=1,将start转移到不等的地方。

Python代码

class Solution(object):def search(self, nums, target):""":type nums: List[int]:type target: int:rtype: int"""if nums==[]:return Falseend=len(nums)-1start=0while start<=end:mid=(start+end)/2if nums[mid]==target:return Trueif nums[mid]>nums[start]:if nums[start]<=target and target<nums[mid]:end=midelse:start=mid+1elif nums[mid]<nums[start]:if nums[end]>=target and nums[mid]<target:start=mid+1else:end=midelse:start+=1return False  

转载于:https://www.cnblogs.com/chengyuanqi/p/7120327.html

[算法题] Search in Rotated Sorted Array ii相关推荐

  1. [算法题] Search in Rotated Sorted Array

    题目内容 本题来源LeetCode Suppose an array sorted in ascending order is rotated at some pivot unknown to you ...

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

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

  3. leetcode 81 Search in Rotated Sorted Array II ----- java

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

  4. 81. Search in Rotated Sorted Array II

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

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

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

  6. LeetCode Search in Rotated Sorted Array II

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

  7. Search in Rotated Sorted Array II

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

  8. LeetCode Online Judge 题目C# 练习 - Search in Rotated Sorted Array II

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

  9. leetcode - Search in Rotated Sorted Array II

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

最新文章

  1. mysql 8.0配置主从同步_MySQL8.0.19开启GTID主从同步CentOS8
  2. live555源码分析----RSTPServer创建过程分析
  3. Thymeleaf 模板 springboot集成使用
  4. osg动态加载模型不显示_OSG仿真案例(8)——读取FBX格式文件并显示(无动画)...
  5. 2017.6.28 文艺平衡树 思考记录
  6. android 4g获取mac地址,Android手机获取Mac地址的几种方法
  7. TensorFlow中数据的feed与fetch
  8. python查找文字在图片中的位置_python实现简单图片文字识别翻译OCR
  9. chrome分辨率测试工具
  10. 深度学习涉及到的线性代数知识点总结(一)
  11. 你需要知道的物联网开放平台
  12. 模板方法 (宝,我输液了,输的想你的夜)
  13. 如何入门短视频剪辑?先要有五大思维,有想法才能有如神助
  14. JAVA中的getBytes方法
  15. jenkins 插件_Jenkins通过Ruby插件赢得了新的皇冠
  16. 电脑快捷键横屏变竖屏_电脑屏幕横屏与竖屏之间怎么来回切换?
  17. 有趣问题——赛马游戏
  18. (2.3)【遥控型木马-灰鸽子】原理、使用方法
  19. linux 安装minio并设置开机自启动
  20. 大学计算机基础知识学习计划,大学个人学习计划

热门文章

  1. TP v5中环境变量在项目中的应用
  2. 【bzoj2434】[Noi2011]阿狸的打字机 AC自动机+Dfs序+树状数组
  3. C# Java间进行RSA加密解密交互
  4. Perl中的单行凝视和多行凝视
  5. C# 获取当前月第一天和最后一天 计算两个日期差多少天
  6. 壊小子的学习【程序开发学习篇】(一)培训时期的学习
  7. 初学者浅谈我对领域驱动设计(DDD)的理解
  8. PAT 1037 在霍格沃茨找零钱(20)(代码+思路)
  9. gerrit上sshkey设置问题
  10. [计算机视觉][神经网络与深度学习]Faster R-CNN配置及其训练教程