【LeetCode】278. First Bad Version
来源:互联网 发布:聚拓数据录入工资说明 编辑:程序博客网 时间:2024/04/29 03:16
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.
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.
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.
二分查找
// Forward declaration of isBadVersion API.bool isBadVersion(int version);class Solution {public: int firstBadVersion(int n) { int low= 1; int high = n; int pos=0; int i; while(low < high){ i = low + (high - low)/2; if(isBadVersion(i)) high = i; else low = i + 1; } return low; }};
0 0
- 278. First Bad Version LeetCode
- LeetCode 278. First Bad Version
- 【LeetCode】278. First Bad Version
- Leetcode 278. First Bad Version
- leetcode 278. First Bad Version
- LeetCode 278. First Bad Version
- LeetCode *** 278. First Bad Version
- [leetcode] 278. First Bad Version
- LeetCode 278. First Bad Version
- leetcode-278. First Bad Version
- LeetCode 278. First Bad Version
- [Leetcode] 278. First Bad Version
- Leetcode 278. First Bad Version
- [leetcode]278. First Bad Version
- LeetCode 278. First Bad Version
- Leetcode 278. First Bad Version
- LeetCode-278.First Bad Version
- LeetCode - 278. First Bad Version
- 关于java对象复制clone 给一个对象赋值 会随原来的对象变化
- 线程间协作:wait、notify、notifyAll
- 47. Permutations II LeetCode
- 2016SDAU课程练习一1016Q
- 接续符和转义符
- 【LeetCode】278. First Bad Version
- 语义化标签,和类名说再见
- 正则表达式初学习
- HTTP 请求方式: GET和POST的比较
- Redis的阻塞式列表解析
- poj 1804 Brainman(归并排序求逆序对)
- RMAN之恢复控制文件
- js之闭包
- hdu2955 01背包