First Bad Version问题及解法
来源:互联网 发布:ubuntu 16.04好用吗 编辑:程序博客网 时间:2024/05/22 11:32
问题描述:
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.
采用二分查找,时间复杂度O(lg N),这里有个编程细节:
在求mid中点值时,mid = left + (right - left) / 2比mid = (left + right) / 2运算速度要快。
过程详见代码:
// Forward declaration of isBadVersion API.bool isBadVersion(int version);class Solution {public: int firstBadVersion(int n) { int left = 1; int right = n; int mid; while(left < right) { mid = left + (right - left) / 2; if(isBadVersion(mid)) { right = mid;}else {left = mid + 1;}}return left; }};
- First Bad Version问题及解法
- leetcode[First Bad Version]//待整理多种解法
- [刷题]First Bad Version
- first bad version
- First Bad Version
- [leetcode]First Bad Version
- First Bad Version
- LeetCode First Bad Version
- [leetcode] First Bad Version
- 278 First Bad Version
- First Bad Version
- [Leetcode]First Bad Version
- Leetcode: First Bad Version
- leetcode First Bad Version
- LeetCode || First Bad Version
- [leetcode]First Bad Version
- Leetcode: First Bad Version
- First Bad Version
- NOIP2016 day2 t2蚯蚓
- 278. First Bad Version (二分,java)
- android权限大全
- Oracle 约束规则(三)
- 数据库第1天
- First Bad Version问题及解法
- JMeter 资源文件接口请求
- BigInteger用法
- MySQL:安装MySQL及环境配置
- 格布局基本用法
- 判断序列是否是二叉查找树的后续遍历结果
- [Cmusphinx] install problem
- Tomcat中设置数据源和连接池
- Bootstrap栅格参数