C++中求旋转数组中的最小数字（经典面试题）

Min_RotateArray.hpp

#pragma once

#include

usingnamespacestd;

intMin_RotateArray(intarry[],intsize)

{

  if(arry == NULL || size <= 0)

  {cout<<"参数输入错误！！！"<

  intmin = 0;

  intindex1 = 0;

  intindex2 = size-1;

  intmiddle = (index1+index2)/2;

  if(arry[0] < arry[size-1])

    returnarry[0];

  while(arry[index1] >= arry[index2])

  {

    if(index2-index1 == 1)

    {

      min=index2;

      break;

    }

    middle = (index1+index2)/2;

    if(arry[index1] <= arry[middle])//arry[middle]还在第一个递增序列中

    {

      index1 = middle;

    }

    else            

    {

      if(arry[index1] >= arry[middle])//arry[middle]在第二个递增序列中

      {index2 = middle;}

      if(arry[index1] == arry[index2] && arry[index1] == arry[middle])

      {

        for(inti=0;i

        {

          if(arry[min]>arry[i])

            {

              min = i;

              break;

            }

        }

      }

    }

  }

  returnarry[min];

}

Min_RotateArray.cpp

#include"Min_RotateArray.hpp"

intmain()

{

  intarry[] = {3,4,5,1,2};

  intsize =sizeof(arry)/sizeof(arry[0]);

  intmin = Min_RotateArray(arry,size);

  cout<<"The min is:"<

  system("pause");

  return0;

}