278. First Bad Version
来源:互联网 发布:方便面怎么煮好吃知乎 编辑:程序博客网 时间:2024/06/05 17:51
题目
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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
Subscribe to see which companies asked this question.
思路
二分查找法
代码
// Forward declaration of isBadVersion API.bool isBadVersion(int version);class Solution {public: int firstBadVersion(int n) { //二分查找法 int beginVersion = 1; int endVersion = n; int middleVersion; int errorVersion = 0; //这里注意要用<= while(beginVersion <= endVersion) { middleVersion = beginVersion + (endVersion - beginVersion)/2; if(isBadVersion(middleVersion)) { errorVersion = middleVersion; endVersion = middleVersion - 1; } else { beginVersion = middleVersion+1; } } return errorVersion; }};
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- 278. First Bad Version
- “以人为本”谋创新 三星手机卓越品质赢得市场与口碑
- 选夫婿1(结构体)
- K上升序列总和
- 广义线性模型
- 自己动手搭梯子——从vps到SSR菜鸟教程
- 278. First Bad Version
- POJ 2125 Destroying The Graph 二分图 最小点权覆盖
- Python else语句
- 入门训练 Fibonacci数列
- 【详解】嵌入式开发中固件的烧录方式
- java输入输出(二)
- 内核链
- Web基础之CSS3
- 268. Missing Number