VaccyZhu的博客

二分查找pythonclass Solution: def searchMatrix(self, matrix: List[List[int]], target: int): m = len(matrix) n = len(matrix[0]) for line in matrix: if target < line[0] or target > line[-1]: contin

二分查找，但会超时，主要是数组中的相同元素过度而导致延申查找超时（时间复杂度变成O(N^2)，原本应为O(NlogN)）

二分查找easy难度题。

二分查找easy难度题。

二分查找easy难度题。

class Solution: def isPerfectSquare(self, num: int) -> bool: if num == 1: return True left, right = 0, num-1 while left <= right: mid = int(left + (right - left)/2) if mid

算法思想：一、没看答案：while循环用来负责target在数组中不存在的情况下将target+1并继续搜索，直到搜索到或者超过了数组的最大值（因为数组是有序的，最大值就是数组最后一个值），并按情况返回下标索引。因为target是不断增大的，所以如果target一开始就小于数组最小值，要额外判断并输出0。C++class Solution {public: int searchInsert(vector<int>& nums, int target) {

没看答案，考察的是有重复数字数组的二分查找的左右边界问题。class Solution: def left_bound(self, nums, target): left, right = 0, len(nums)-1 while left <= right: mid = int(left + (right - left)/2) if nums[mid] == target:

pythonclass Solution: def findMin(self, nums: List[int]): left, right = 0, len(nums)-1 while left < right: mid = int(left + (right-left)/2) if nums[mid] > nums[right]: left = mid + 1

pythonclass Solution: def findMin(self, nums: List[int]): left, right = 0, len(nums)-1 while left < right: mid = int(left + (right-left)/2) if nums[mid] <= nums[right]: right = mid

pythonclass Solution: def search(self, nums: List[int], target: int): left, right = 0, len(nums)-1 res = 0 while left <= right: mid = int(left + (right-left)/2) if nums[mid] == target:

python线性遍历import sysclass Solution: def findPeakElement(self, nums: List[int]): n = len(nums) nums.append(-sys.maxsize) for i in range(n): if nums[i] > nums[i-1] and nums[i] > nums[i+1]: ret

二分查找pythonclass Solution: def search(self, nums: List[int], target: int): if nums == None: return -1 n = len(nums) l, r = 0, n-1 while l <= r: mid = (l + r) // 2 if nums

算法思想暴力解法pythonclass Solution: def mySqrt(self, x: int): if x == 0 or x == 1: return x res = 0 for i in range(x): if i * i > x: return res res = i return

C++暴力解法：class Solution {public: int findRepeatNumber(vector<int>& nums) { vector<int> rec; for(auto v : nums){ if(find(rec.begin(), rec.end(), v) == rec.end()){ rec.push_back(v);

class Solution {public: int missingNumber(vector<int>& nums) { if(nums.empty()) return 0; for(int i = 1; i < ; i++){ if(a[i] - 1== a[i - 1]) continue; else{ return a[i] - 1;

class Solution {public: int search(vector<int>& nums, int target) { if(nums.empty()) return -1; if(nums[0] == target){ return 0; } int index0 = 0; int index1 = nums.size() - 1; int

python一. 无脑傻瓜版本：1.把两个数组合并成一个数组并排序；2.找到新数组的中位数。class Solution: def findMedianSortedArrays(self, nums1, nums2): ls = list() for i in nums1: ls.append(i) for j in nums2: ls.append(j) ls.