leetcode二分查找
文章平均质量分 62
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
1337. The K Weakest Rows in a Matrix[Easy](Leetcode每日一题-2021.08.01)
ProblemYou are given an m x n binary matrix mat of 1’s (representing soldiers) and 0’s (representing civilians). The soldiers are positioned in front of the civilians. That is, all the 1’s will appear to the left of all the 0’s in each row.A row i is wea原创 2021-08-02 22:45:05 · 340 阅读 · 0 评论 -
1713. Minimum Operations to Make a Subsequence[Hard](Leetcode每日一题-2021.07.26)--抄答案
Problem原创 2021-07-26 19:43:47 · 286 阅读 · 0 评论 -
剑指 Offer 53 - I. 在排序数组中查找数字 LCOF[Easy](Leetcode每日一题-2021.07.16)
Problem统计一个数字在排序数组中出现的次数。限制:0 <= 数组长度 <= 50000Example1输入: nums = [5,7,7,8,8,10], target = 8输出: 2Example2输入: nums = [5,7,7,8,8,10], target = 6输出: 0Solutionclass Solution {public: int search(vector<int>& nums, int target原创 2021-07-16 22:12:29 · 162 阅读 · 0 评论 -
1818. Minimum Absolute Sum Difference[Medium](Leetcode每日一题-2021.07.14)--抄答案
ProblemYou are given two positive integer arrays nums1 and nums2, both of length n.The absolute sum difference of arrays nums1 and nums2 is defined as the sum of |nums1[i] - nums2[i]| for each 0 <= i < n (0-indexed).You can replace at most one ele原创 2021-07-14 19:31:01 · 300 阅读 · 0 评论 -
275. H-Index II[Medium](Leetcode每日一题-2021.07.12)--抄答案
ProblemGiven an array of integers citations where citations[i] is the number of citations a researcher received for their ith paper and citations is sorted in an ascending order, return compute the researcher’s h-index.According to the definition of h-in原创 2021-07-12 21:37:22 · 195 阅读 · 0 评论 -
852. Peak Index in a Mountain Array[Easy](Leetcode每日一题-2021.06.15)
ProblemLet’s call an array arr a mountain if the following properties hold:arr.length >= 3There exists some i with 0 < i < arr.length - 1 such that:arr[0] < arr[1] < … arr[i-1] < arr[i]arr[i] > arr[i+1] > … > arr[arr.lengt原创 2021-06-15 08:31:39 · 192 阅读 · 1 评论 -
374. Guess Number Higher or Lower[Easy](Leetcode每日一题-2021.06.14)
ProblemWe are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess.You call a pre-原创 2021-06-15 08:28:42 · 513 阅读 · 0 评论 -
278. First Bad Version[Easy](Leetcode每日一题-2021.06.13)
ProblemYou 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原创 2021-06-15 08:26:19 · 153 阅读 · 0 评论 -
1482. Minimum Number of Days to Make m Bouquets[Medium](Leetcode每日一题-2021.05.09)--抄答案
ProblemGiven an integer array bloomDay, an integer m and an integer k.We need to make m bouquets. To make a bouquet, you need to use k adjacent flowers from the garden.The garden consists of n flowers, the ith flower will bloom in the bloomDay[i] and th原创 2021-05-09 21:26:22 · 383 阅读 · 0 评论 -
1723. Find Minimum Time to Finish All Jobs[Hard](Leetcode每日一题-2021.05.08)--抄答案
ProblemYou are given an integer array jobs, where jobs[i] is the amount of time it takes to complete the ith job.There are k workers that you can assign jobs to. Each job should be assigned to exactly one worker. The working time of a worker is the sum o原创 2021-05-08 17:33:16 · 236 阅读 · 0 评论 -
1011. Capacity To Ship Packages Within D Days(Leetcode每日一题-2021.04.26)
ProblemA conveyor belt has packages that must be shipped from one port to another within D days.The ith package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights)原创 2021-04-26 20:48:16 · 305 阅读 · 0 评论 -
154. Find Minimum in Rotated Sorted Array II(Leetcode每日一题-2021.04.09)
ProblemSuppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become:[4,5,6,7,0,1,4] if it was rotated 4 times.[0,1,4,4,5,6,7] if it was rotated 7 times.Notice that原创 2021-04-09 10:38:54 · 620 阅读 · 0 评论 -
153. Find Minimum in Rotated Sorted Array(Leetcode每日一题-2021.04.08)
ProblemSuppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:[4,5,6,7,0,1,2] if it was rotated 4 times.[0,1,2,4,5,6,7] if it was rotated 7 times.Notice that原创 2021-04-08 11:41:33 · 669 阅读 · 0 评论 -
81. Search in Rotated Sorted Array II(Leetcode每日一题-2021.04.07)
ProblemThere is an integer array nums sorted in non-decreasing order (not necessarily with distinct values).Before being passed to your function, nums is rotated at an unknown pivot index k (0 <= k < nums.length) such that the resulting array is [n原创 2021-04-07 16:14:08 · 661 阅读 · 0 评论 -
74. Search a 2D Matrix(Leetcode每日一题-2021.03.30)
ProblemWrite an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each row is greater than the last integer of the previous原创 2021-03-30 08:59:54 · 224 阅读 · 0 评论 -
1631. Path With Minimum Effort(Leetcode每日一题-2021.01.29)--抄答案
ProblemYou are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and you hope to travel to the原创 2021-01-29 19:44:48 · 217 阅读 · 0 评论 -
34. Find First and Last Position of Element in Sorted Array(Leetcode每日一题-2020.12.01)
ProblemGiven an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.If target is not found in the array, return [-1, -1].Follow up: Could you write an algorithm with O(log n) runtime complexity原创 2020-12-01 21:54:40 · 142 阅读 · 0 评论 -
222. Count Complete Tree Nodes(Leetcode每日一题-2020.11.24)
ProblemGiven a complete binary tree, count the number of nodes.Note:Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level are as far le原创 2020-11-24 09:45:22 · 194 阅读 · 0 评论 -
面试题 08.03. Magic Index LCCI(Leetcode每日一题-2020.07.31)
ProblemA magic index in an array A[0…n-1] is defined to be an index such that A[i] = i. Given a sorted array of integers, write a method to find a magic index, if one exists, in array A. If not, return -1. If there are more than one magic index, return th原创 2020-07-31 21:24:16 · 212 阅读 · 0 评论 -
剑指 Offer 11. 旋转数组的最小数字&154. Find Minimum in Rotated Sorted Array II(Leetcode每日一题-2020.07.22)
ProblemSuppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).Find the minimum element.The array may contain duplicates.Example1Input: [1,3,5]Output: 1E原创 2020-07-22 21:12:41 · 175 阅读 · 0 评论 -
35. Search Insert Position(Leetcode每日一题-2020.07.17)
ProblemGiven a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Example1Input: [1,3,5,6], 5Output: 2Example2原创 2020-07-18 10:06:31 · 167 阅读 · 0 评论 -
378. Kth Smallest Element in a Sorted Matrix(Leetcode每日一题-2020.07.02)
ProblemGiven a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.Note that it is the kth smallest element in the sorted order, not the kth distinct element.ExampleSolutionSoluti原创 2020-07-02 21:19:34 · 301 阅读 · 0 评论 -
1300. Sum of Mutated Array Closest to Target(Leetcode每日一题-2020.06.14)
ProblemGiven an integer array arr and a target value target, return the integer value such that when we change all the integers larger than value in the given array to be equal to value, the sum of the array gets as close as possible (in absolute differen原创 2020-06-15 19:23:43 · 258 阅读 · 0 评论 -
287. Find the Duplicate Number(Leetcode每日一题-2020.05.26)
ProblemGiven an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.Example1Input: [1,3,4,2,原创 2020-05-26 23:03:20 · 265 阅读 · 0 评论 -
4. Median of Two Sorted Arrays(Leetcode每日一题-2020.05.24)
ProblemThere are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).You may assume nums1 and nums2 cannot be both empty.Example1nums1 = [1, 3原创 2020-05-24 22:57:22 · 177 阅读 · 0 评论 -
50. Pow(x, n)(Leetcode每日一题-2020.05.11)
ProblemImplement pow(x, n), which calculates x raised to the power n.Example1Input: 2.00000, 10Output: 1024.00000Example2Input: 2.10000, 3Output: 9.26100Example3Input: 2.00000, -2Output: 0.25000Explanation: 2-2 = 1/22 = 1/4 = 0.25Solution原创 2020-05-11 22:26:17 · 200 阅读 · 0 评论 -
69. Sqrt(x)(Leetcode每日一题-2020.05.09)
ProblemImplement int sqrt(int x).Compute and return the square root of x, where x is guaranteed to be a non-negative integer.Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.Examp原创 2020-05-10 09:41:50 · 313 阅读 · 0 评论 -
1095. Find in Mountain Array(Leetcode每日一题-2020.04.29)
Problem(This problem is an interactive problem.)You may recall that an array A is a mountain array if and only if:A.length >= 3There exists some i with 0 < i < A.length - 1 such that:A...原创 2020-04-29 22:49:33 · 187 阅读 · 0 评论 -
33. Search in Rotated Sorted Array(Leetcode每日一题-2020.04.27)
ProblemSuppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).You are given a target value to search. If ...原创 2020-04-27 22:15:53 · 183 阅读 · 0 评论 -
887. Super Egg Drop(Leetcode每日一题-2020.04.11)
占位原创 2020-04-14 22:48:00 · 225 阅读 · 0 评论 -
300. Longest Increasing Subsequence(Leetcode每日一题-2020.03.14)
ProblemGiven an unsorted array of integers, find the length of longest increasing subsequence.Note:There may be more than one LIS combination, it is only necessary for you to return the length.You...原创 2020-03-14 22:43:35 · 418 阅读 · 0 评论