剑指offer——旋转数组的最小值

<strong><span style="font-size:18px;">#pragma once
#include <iostream>
using namespace std;
#include <assert.h>

template<class T>
T& RevolveArray(T* arr,size_t size,size_t k)
{
assert(arr);

T min = arr[0];
T tmp = 0;
while (k--)
{
tmp = arr[0];
for (int index = 1;index < size;++index)
{
if (min > arr[index])
{
min = arr[index];
}
arr[index - 1] = arr[index];
}
arr[size-1] = tmp;
}
return min;
}</span></strong>

<strong><span style="font-size:18px;">#define _CRT_SECURE_NO_WARNINGS 1

#include "RevolveArray.h"

void test1()
{
//int arr[] = {1,2,3,4,5};
int arr[] = {8,3,7,2,0};
int size = sizeof(arr)/sizeof(arr[0]);
int count = 0;
cout<<"请输入需要旋转数组的个数"<<endl;
cin>>count;
int min = RevolveArray<int>(arr,size,count);

for (int i = 0;i < size;i++)
{
cout<<arr[i]<<" ";
}
cout<<endl<<"min = "<<min<<endl;
}

int main()
{
test1();
system("pause");
return 0;
}</span></strong>