Leetcode 剑指 Offer 11 旋转数组的最小数字

最新推荐文章于 2022-11-10 17:18:11 发布

CoCo_DY

最新推荐文章于 2022-11-10 17:18:11 发布

阅读量119

点赞数

分类专栏： c语言 leetcode 算法

本文链接：https://blog.csdn.net/qq_33146555/article/details/107381281

版权

算法同时被 3 个专栏收录

40 篇文章 0 订阅

订阅专栏

leetcode

39 篇文章 0 订阅

订阅专栏

c语言

34 篇文章 0 订阅

订阅专栏

这道题考察的是二分检索算法。

内存和时间消耗以及源代码如下：

int inorder (int* numbers, int numbersSize){
    int small   =   0;
    for (unsigned   int i=1;  i<numbersSize;   i++)
    {
        if  (numbers[i] <   numbers[small])
        {
            small   =   i;
            break;
        }
    }
    return  small;
}

int minArray(int* numbers, int numbersSize){
    if  (numbers[0] ==  NULL    ||  numbersSize ==  0)
    {
        return  NULL;
    }

    int Firstpoint  =   0;
    int Lastpoint   =   numbersSize -   1;
    int Midpoint    =   Firstpoint;

    if  (numbersSize    >  1)
    {           
        if  (numbers[Firstpoint]   >=   numbers[Lastpoint])
        {
            if  (numbers[Firstpoint]   ==   numbers[Lastpoint]
            &&  numbers[(Firstpoint +   Lastpoint)  /   2]  ==  
                numbers[Firstpoint])
            {
                Midpoint    =   inorder (numbers,   numbersSize);
            }

            else
            {
                while   (Lastpoint  -   Firstpoint  >   1)
                {
                    Midpoint    =   (Firstpoint +   Lastpoint)  /   2;

                    if  (numbers[Midpoint]  >=  numbers[Firstpoint])
                    {
                        Firstpoint  =   Midpoint;
                    }

                    else    if  (numbers[Midpoint]  <=  
                                numbers[Lastpoint])
                    {
                        Lastpoint   =   Midpoint;
                    }
                }
                Midpoint    =   Lastpoint;
            }
            
        }   
        
    }
    return  numbers[Midpoint];
}