[LeetCode] 278. First Bad Version

https://leetcode.com/problems/first-bad-version/

피봇을 사용하여 탐색하는 문제입니다.

First Bad Version - LeetCode

---

솔루션

# The isBadVersion API is already defined for you.
# def isBadVersion(version: int) -> bool:

class Solution:
    def firstBadVersion(self, n: int) -> int:
        pivot = n//2
        pivot_smallest = 1
        pivot_largest = n

        while pivot_smallest != pivot_largest:
            if isBadVersion(pivot) == False:
                pivot_smallest = pivot + 1
                pivot = (pivot_largest + pivot_smallest)//2
            else:
                pivot_largest = pivot
                pivot = (pivot_largest + pivot_smallest)//2

        return pivot_smallest