旋转数组的最小数字,没太理解,所以就判断最小的下标,然后翻转最小值之后的,带测试
//#include "stdafx.h"
#include<iostream>
#include<string>
#include<cctype>
#include <vector>
#include<exception>
#include <initializer_list>
#include<stack>
using namespace std;
class Solution {
public:
vector<int> minNumberInRotateArray(vector<int> rotateArray) {
int temp= rotateArray[0],j=0;//临时变量
for (int i = 0; i < rotateArray.size(); i++) {//判断最小值位置下标
if(rotateArray[i]<temp){
temp = rotateArray[i];
j = i;
}
}
vector<int> temp2;
for (int i = 0; i < j; i++) {
temp2.push_back(rotateArray[j + i]);//将前部分后入到新向量中
}
for (int i = 0; (i+j)< rotateArray.size(); i++) {
temp2.push_back(1);//将后部分后入到新向量中
}
return temp2;//返回向量
}
};
int main()
{
Solution a;
vector<int> in = { 4, 7, 2, 1, 5, 3, 8, 6 },b;
b=a.minNumberInRotateArray(in);
cout << b[0];
}