LeetCode 33. Search in Rotated Sorted Array
来源:互联网 发布:mac svn 管理工具下载 编辑:程序博客网 时间:2024/05/02 06:36
问题描述:
Suppose a sorted array 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
).
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.
个人解题的大致步骤:1.由反转数组得到正常的有序数组。
2.利用二分法查找target。
3.找出正常有序数组中的元素下标与反转后的数组的下标的关系。
AC代码如下:
</pre><pre name="code" class="cpp">int search(vector<int>& nums, int target){int len = nums.size();int pos;//用于存放原有序数组翻转的位置for (pos = 0;pos < len - 1;pos++){if (nums[pos] > nums[pos + 1])break;}//ori_nums正常有序数组vector<int>ori_nums;for (int i = pos + 1;i < len;i++)ori_nums.push_back(nums[i]);for (int i = 0;i <= pos;i++)ori_nums.push_back(nums[i]);//二分查找targetint low = 0;int high = len - 1;int mid;int ori_pos = -1;while (low <= high){mid = low + (high - low) / 2;if (ori_nums[mid] > target)high = mid - 1;else if (ori_nums[mid] < target)low = mid + 1;else{//找到后记得跳出循环ori_pos = mid;break;}}//证明没找到if (ori_pos == -1)return -1;else{//当前正常有序数组的index转换到反转数组中的index//分 反转点pos前后两种情况if (target >= nums[0])return (ori_pos - len + pos + 1);elsereturn (ori_pos + pos + 1);}}
还有一个 LeeTCode 81. Search in Rotated Sorted Array II 就是数组中有重复的元素,基本和这一题一样,其实还更简单一点,这里就不再列出代码了。
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
- Python与C++交互
- AS小贴士
- Gradle学习系列之四——增量式构建
- NSURLConnection的GET和POST
- java final和static的区别
- LeetCode 33. Search in Rotated Sorted Array
- 实现新浪微博第三方登录获取用户信息
- 转载一篇写KMP算法写得非常好的博文
- public static void 可以写成 static public void
- 动态加载配置文件实践
- 关于centos 执行yum -y install xxx报错Could not retrieve mirrorlist http://mirrorlist.centos.org/?
- android 对线程池的探究
- 让html标签显示在页面上
- Python核心编程(第十三章)--面向对象编程