[LeetCode] First Bad Version - 二分查找
2015-09-09 02:16
387 查看
题目概述:
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 boolisBadVersion(version)
which will return whetherversion is bad. Implement a function to find
the first bad version. You should minimize the number of calls to the API.
题目解析:
数组[1,2..n]中存在一个bad版本时,后面的版本都是bad,通过调用函数isBadVersion可以判断是否是bad版本。例如:[1,2,3]中2是bad版本,则调用isBadVersion(2)=true、isBadVersion(1)=false、isBadVersion(3)=true,结果返回2第一个导致bad的版本。
解决方法:二分查找
需注意middle=left+(right-left)/2、二分查找的下标移动和返回值left。
我的代码:
其他题目:
(By:Eastmount 2015-9-9 凌晨2点 http://blog.csdn.net/eastmount/)
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 boolisBadVersion(version)
which will return whetherversion is bad. Implement a function to find
the first bad version. You should minimize the number of calls to the API.
题目解析:
数组[1,2..n]中存在一个bad版本时,后面的版本都是bad,通过调用函数isBadVersion可以判断是否是bad版本。例如:[1,2,3]中2是bad版本,则调用isBadVersion(2)=true、isBadVersion(1)=false、isBadVersion(3)=true,结果返回2第一个导致bad的版本。
解决方法:二分查找
需注意middle=left+(right-left)/2、二分查找的下标移动和返回值left。
我的代码:
// Forward declaration of isBadVersion API. bool isBadVersion(int version); /* * 二分查找 关键步骤: * 1.middle定位 * 2.大于middle查找右部分 left=middle+1 * 3.小于middle查找左部分 right=middle-1 */ int firstBadVersion(int n) { int middle; int left; int right; left=1; right=n; while(left<=right) { middle = left+(right-left)/2; //重点&能防止越界 例1+(5-1)/2=3 if(isBadVersion(middle)==true) { right = middle-1; } else { left = middle+1; } } return left; }
其他题目:
(By:Eastmount 2015-9-9 凌晨2点 http://blog.csdn.net/eastmount/)
相关文章推荐
- 免费开源3D模型设计软件汇总
- 2015年9月8日
- 免费开源3D模型设计软件汇总
- Qml之坐标轴的实现及曲线添加
- PE32-Pandigital products
- 如何为编程爱好者设计一款好玩的智能硬件(四)——初尝试·把温湿度给收集了(上)!
- oschina多媒体工具
- UVA11572_Unique Snowflakes
- oschina多媒体工具
- oschina文件传输
- oschina文件传输
- 完整全面的Java资源库(包括构建、操作、代码分析、编译器、数据库、社区等等)
- oschina压缩工具
- oschina压缩工具
- 详解Linux运维工程师应具备的十大技能
- oschina下载工具
- Processing 教程(12) - 快与慢:两个圆弧的运动
- oschina下载工具
- Leetcode Valid Anagram
- oschina 终端/远程登录