大白的故事 大白的故事
首页
  • 学习笔记

    • LeetCode题解导航
  • 学习笔记

    • TypeScript笔记
页面
技术
  • 友情链接
关于
  • 分类
  • 标签
  • 归档
GitHub (opens new window)
dbdgs

大白的故事

终身学习者
首页
  • 学习笔记

    • LeetCode题解导航
  • 学习笔记

    • TypeScript笔记
页面
技术
  • 友情链接
关于
  • 分类
  • 标签
  • 归档
GitHub (opens new window)
  • leetcode

  • leetcode-p2

    • leetcode261 Graph Valid Tree-zh
    • leetcode262 Trips and Users-zh
    • leetcode263 ugly-number-zh
    • leetcode264 Ugly Number II-zh
    • leetcode265 Paint House II-zh
    • leetcode266 Palindrome Permutation-zh
    • leetcode267 Palindrome Permutation II-zh
    • leetcode268 Missing Number-zh
    • leetcode269 Alien Dictionary-zh
    • leetcode270 Closest Binary Search Tree Value-zh
    • leetcode271 Encode and Decode Strings-zh
    • leetcode272 Closest Binary Search Tree Value II-zh
    • leetcode273 Integer to English Words-zh
    • leetcode274 H-Index-zh
    • leetcode275 H-Index II-zh
    • leetcode276 Paint Fence-zh
    • leetcode277 Find the Celebrity-zh
    • leetcode278 First Bad Version-zh
      • 题目描述
      • 解法
        • Python3
        • Java
        • C++
        • JavaScript
        • Go
        • ...
    • leetcode279 Perfect Squares-zh
    • leetcode280 Wiggle Sort-zh
    • leetcode281 Zigzag Iterator-zh
    • leetcode282 Expression Add Operators-zh
    • leetcode283 Move Zeroes-zh
    • leetcode284 Peeking Iterator-zh
    • leetcode285 Inorder Successor in BST-zh
    • leetcode286 Walls and Gates-zh
    • leetcode287 Find the Duplicate Number-zh
    • leetcode288 Unique Word Abbreviation-zh
    • leetcode289 Game of Life-zh
    • leetcode290 Word Pattern-zh
  • 算法
  • leetcode-p2
geekzl.com
2021-07-19

leetcode278 First Bad Version-zh

# 278. 第一个错误的版本 (opens new window)

English Version (opens new window)

# 题目描述

你是产品经理,目前正在带领一个团队开发新的产品。不幸的是,你的产品的最新版本没有通过质量检测。由于每个版本都是基于之前的版本开发的,所以错误的版本之后的所有版本都是错的。

假设你有 n 个版本 [1, 2, ..., n],你想找出导致之后所有版本出错的第一个错误的版本。

你可以通过调用 bool isBadVersion(version) 接口来判断版本号 version 是否在单元测试中出错。实现一个函数来查找第一个错误的版本。你应该尽量减少对调用 API 的次数。

示例:

给定 n = 5,并且 version = 4 是第一个错误的版本。

调用 isBadVersion(3) -> false
调用 isBadVersion(5) -> true
调用 isBadVersion(4) -> true

所以,4 是第一个错误的版本。 

# 解法

二分查找。

# Python3

# The isBadVersion API is already defined for you.
# @param version, an integer
# @return an integer
# def isBadVersion(version):

class Solution:
    def firstBadVersion(self, n):
        """
        :type n: int
        :rtype: int
        """
        left, right = 1, n
        while left < right:
            mid  = (left + right) >> 1
            if isBadVersion(mid):
                right = mid
            else:
                left = mid + 1
        return left
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19

# Java

/* The isBadVersion API is defined in the parent class VersionControl.
      boolean isBadVersion(int version); */

public class Solution extends VersionControl {
    public int firstBadVersion(int n) {
        int left = 1, right = n;
        while (left < right) {
            int mid = (left + right) >>> 1;
            if (isBadVersion(mid)) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

# C++

// The API isBadVersion is defined for you.
// bool isBadVersion(int version);

class Solution {
public:
    int firstBadVersion(int n) {
        int left = 1, right = n;
        while (left < right) {
            int mid = left + ((right - left) >> 1);
            if (isBadVersion(mid)) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18

# JavaScript

/**
 * Definition for isBadVersion()
 * 
 * @param {integer} version number
 * @return {boolean} whether the version is bad
 * isBadVersion = function(version) {
 *     ...
 * };
 */

/**
 * @param {function} isBadVersion()
 * @return {function}
 */
var solution = function(isBadVersion) {
    /**
     * @param {integer} n Total versions
     * @return {integer} The first bad version
     */
    return function(n) {
        let left = 1;
        let right = n;
        while (left < right) {
            const mid = (left + right) >>> 1;
            if (isBadVersion(mid)) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    };
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

# Go

/**
 * Forward declaration of isBadVersion API.
 * @param   version   your guess about first bad version
 * @return 	 	      true if current version is bad
 *			          false if current version is good
 * func isBadVersion(version int) bool;
 */

func firstBadVersion(n int) int {
	left, right := 1, n
	for left < right {
		mid := (left + right) >> 1
		if isBadVersion(mid) {
			right = mid
		} else {
			left = mid + 1
		}
	}
	return left
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

# ...


1
编辑 (opens new window)
#leetcode
上次更新: 2021/10/30, 12:58:38
leetcode277 Find the Celebrity-zh
leetcode279 Perfect Squares-zh

← leetcode277 Find the Celebrity-zh leetcode279 Perfect Squares-zh→

最近更新
01
leetcode2 Add Two Numbers
07-19
02
leetcode3 Longest Substring Without Repeating Characters
07-19
03
leetcode5 Longest Palindromic Substring
07-19
更多文章>
Theme by Vdoing | Copyright © 2020 大白的故事 | MIT License
  • 跟随系统
  • 浅色模式
  • 深色模式
  • 阅读模式