[leetCode 第1题] -- Find Minimum in Rotated Sorted Array
来源：互联网 发布：网络的拓扑结构是指 编辑：程序博客网 时间：2024/06/11 14:35
题目链接: Find Minimun in Rotated Sorted Array
题目意思: 给定一个旋转数组，找出这个旋转数组的最小元素。旋转数组的定义是，把一个从小到大排好序的数组，取一部份放到末尾，例如0 1 2 4 5 6 7 取 0 1 2放到末尾，变成旋转数组4 5 6 7 0 1 2
代码:
class Solution {public: int findMin(vector<int> &num); };int Solution::findMin(vector<int> &num) { int length = num.size(); if (length == 1) { return num[0]; } int p1 = 0; int p2 = length -1; while (p1 < p2) { if (p1+1 == p2) { return min(num[p1], num[p2]); } int mid = (p1 + p2) >> 1; if (num[mid] < num[p2]) { p2 = mid; } else { p1 = mid; } }} 0 0
- [leetCode 第1题] -- Find Minimum in Rotated Sorted Array
- leetcode 第153题 Find Minimum in Rotated Sorted Array
- [LeetCode] Find Minimum in Rotated Sorted Array
- Leetcode: Find Minimum in Rotated Sorted Array
- leetcode :Find Minimum in Rotated Sorted Array
- LeetCode:Find Minimum in Rotated Sorted Array
- 【Leetcode】Find Minimum in Rotated Sorted Array
- LeetCode:Find Minimum in Rotated Sorted Array
- LeetCode: Find Minimum in Rotated Sorted Array
- leetcode: Find Minimum in Rotated Sorted Array
- [LeetCode] Find Minimum in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array -- LeetCode
- Leetcode: Find Minimum in Rotated Sorted Array
- leetcode Find Minimum in Rotated Sorted Array
- leetcode - Find Minimum in Rotated Sorted Array
- LeetCode Find Minimum in Rotated Sorted Array
- Leetcode--Find Minimum in Rotated Sorted Array
- leetcode: Find Minimum in Rotated Sorted Array
- git 创建版本库
- 入住CSDN的自我介绍
- 实例介绍Cocos2d-x中Box2D物理引擎：使用关节
- 如何正确使用Java I/O输出和读入数据
- 教你看Mavericks活动监视器里的内存
- [leetCode 第1题] -- Find Minimum in Rotated Sorted Array
- 重载和模板的知识点
- 内核模块运行在哪
- 360公司2015年秋季校园招聘笔试考卷(技术类 D)部分试题程序验证和解析6
- Memory Analyzer tool(MAT)
- Lua学习之2 ：Lua调用C++函数
- linux用户权限和文件权限
- Search a 2D Matrix
- 大数据在传统行业引爆后如何落地
