LeetCode : First Bad Version
来源:互联网 发布:上海威纳数据 编辑:程序博客网 时间:2024/06/15 02:56
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, high=n; while(low<high) { int mid=low + (high-low)/2; if(isBadVersion(mid)) { high = mid; } else { low = mid + 1; } } return low; } };
0 0
- [leetcode]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
- [leetcode]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
- leetcode-First Bad Version
- [LeetCode]First Bad Version
- First Bad Version -- leetcode
- leetcode --First Bad Version
- Nginx 反向代理
- ISE中FPGA的实现流程
- java运行时数据区域
- [LeetCode]551. Student Attendance Record I(根据学生出勤记录判断是否应获奖金)
- imadjust从用法到原理—Matlab灰度变换函数之一
- LeetCode : First Bad Version
- JVM初窥:虚拟机字节码指令表
- AR 应用
- Java内存模型小析值JVM运行时数据区域(一)
- 博客已迁移,本博客不再更新通知
- 阶段一:计数器的仿真实验
- 任给两个节点,如何判断这两个节点是否表示一条边
- PYTHON---DAY3
- 只有改变才能看见未来