LeetCode 278. First Bad Version
来源:互联网 发布:基金公司招聘条件 知乎 编辑:程序博客网 时间:2024/04/30 14:15
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.
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.
2.算法
就是用二分发查找
public int findFirstBadVersion(int n) { // write your code here int l = 1; int r = n; while (l <= r) { int m = l + (r - l) / 2; if (!SVNRepo.isBadVersion(m)) { l = m + 1; }else { r = m - 1; } } return l; }
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
- 只读表空间的备份与恢复
- 并查集 路径压缩
- CTR预估中GBDT与LR融合方案
- hibernate框架初次搭建并使用
- Webview与js交互漏洞及解决方法(有注释代码)
- LeetCode 278. First Bad Version
- MySql常用命令整理
- JAVA实现DES加密实现详解
- CSS3之box-sizing属性分析
- CAD关闭文件时提示对话框信息注意事项
- [蓝桥杯]递归求二项式系数
- Apple Swift3.0 Guides and Sample Code
- hdu5726 GCD ST表+离线
- Android studio打包的时候友盟出错