lintcode:First Bad Version
2016-03-27 17:38
337 查看
Description
Notes
Testcase
Judge
The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the following versions are all failed in the unit tests. Find the first
bad version.
You can call
help you determine which version is the first bad one. The details interface can be found in the code's annotation part.
Have you met this question in a real interview?
Yes
Notice
Please read the annotation in code area to get the correct way to call isBadVersion in different language. For example, Java is
Example
Given n =
Here we are 100% sure that the 4th version is the first bad version.
Challenge
You should call isBadVersion as few as possible.
Notes
Testcase
Judge
The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the following versions are all failed in the unit tests. Find the first
bad version.
You can call
isBadVersionto
help you determine which version is the first bad one. The details interface can be found in the code's annotation part.
Have you met this question in a real interview?
Yes
Notice
Please read the annotation in code area to get the correct way to call isBadVersion in different language. For example, Java is
SVNRepo.isBadVersion(v)
Example
Given n =
5:
isBadVersion(3) -> false isBadVersion(5) -> true isBadVersion(4) -> true
Here we are 100% sure that the 4th version is the first bad version.
Challenge
You should call isBadVersion as few as possible.
/** * class SVNRepo { * public: * static bool isBadVersion(int k); * } * you can use SVNRepo::isBadVersion(k) to judge whether * the kth code version is bad or not. */ class Solution { public: /** * @param n: An integers. * @return: An integer which is the first bad version. */ int findFirstBadVersion(int n) { // write your code here int start = 1; int end = n; while (start <= end) { int mid = (start+end)/2; if (SVNRepo::isBadVersion(mid)) { if (mid == 1 || !SVNRepo::isBadVersion(mid-1) ) { return mid; } end = mid-1; } else { start = mid+1; } } } };
相关文章推荐
- codeforces 351A A. Jeff and Rounding(★)
- 敏捷开发阅读笔记
- Xml编程---Dom4j解析工具
- java小练习:.根据输入的月份,判断该月份有多少天
- Calculator(后缀表达式)
- collection--set--treeSet
- springmvc调用流程
- 构建之法阅读笔记03
- 基础14_转义字符和特殊字符ASCII
- 《leetCode》:Majority Element II
- POJ 3280 Cheapest Palindrome(区间DP)
- 关于国内外CV领域牛人的博客链接
- c++上机作业-2
- 第四周学习进度
- >hibernate.cfg.xml的一些常用配置
- Html5全屏_IE
- C#-readonly与const不同
- code forces 630 P. Area of a Star
- 【java 基础】Windows dos 命令
- Html5全屏_Chrome