剑指Offer刷题笔记

剑指Offer刷题笔记

1.

6.旋转数组的最小数字

二分法，递归的思想

# -*- coding:utf-8 -*-
class Solution:
    def minNumberInRotateArray(self, rotateArray):
        start = 0
        end = len(rotateArray)-1
        if end == 0:
            return 0
        #二分递归程序
        def erfen(i,j):
            mid = int((i+j)/2)
            if i == j or i == j-1:
                return min(rotateArray[i],rotateArray[j])
            if rotateArray[mid] < rotateArray[-1]:
                j = mid
            else:
                i = mid
            return erfen(i,j)
        return erfen(start,end)