My LeetCode grinding. Trying to do a problem a day.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

problem.txt 791B

12345678910111213141516
  1. You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.
  2. Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad.
  3. You are given an API bool isBadVersion(version) which will return whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.
  4. Example:
  5. Given n = 5, and version = 4 is the first bad version.
  6. call isBadVersion(3) -> false
  7. call isBadVersion(5) -> true
  8. call isBadVersion(4) -> true
  9. Then 4 is the first bad version.