目錄79 單詞搜索212 單詞搜索II 79 單詞搜索 class Solution(object):#深度搜索def exist(self, board, word):self.flag=0self.len=len(word)m, n =len(board),len(board[0])# 找起始位for i in range(m):for j in range(n):if board[i][j]==word[0]:se
解题思路 二分查找即可 代码 // The API isBadVersion is defined for you.
// bool isBadVersion(int version);int firstBadVersion(int n) {int left=1;int right=n;while(left<right){int mid=left+(right-left)/2;if(isBadVersion(mid))right=mid