首页 > 其他 > 详细

[LeetCode] First Bad Version

时间:2015-09-07 22:27:26      阅读:250      评论:0      收藏:0      [点我收藏+]

Just use binary search to find the first bad version. The code is as follows.

 1 // Forward declaration of isBadVersion API.
 2 bool isBadVersion(int version);
 3 
 4 class Solution {
 5 public:
 6     int firstBadVersion(int n) {
 7         int l = 1, r = n;
 8         while (l < r) {
 9             int m = l + (r - l) / 2;
10             if (isBadVersion(m)) r = m;
11             else l = m + 1;
12         }
13         return l;
14     }
15 };

 

[LeetCode] First Bad Version

原文:http://www.cnblogs.com/jcliBlogger/p/4790065.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!