【leetcode】旋转数组的最小数字

int minArray(int* numbers, int numbersSize){
    int min = numbers[0];
    for (int i=1; i<numbersSize; i++)
    {
        if (numbers[i]<min)
            min = numbers[i];
    }
    return min;
}