Programmer Group

Sword finger Offer 40. Minimum number of k Just in the last article, we talked about the two sorting methods of small top heap and fast row, which can solve the k-th problem. Official fast platoon use ij exchange Here is my wrong idea To find the k-th, you should first be able to write fast rows. For a round of fast scheduling, the lef ...

1. Title 1. Title Description _Design a class that finds the kth largest element in the data stream. Note that the kth largest element is sorted, not the kth different element. Implement the KthLargest class:_1) KthLargest(int k, int[] nums) initializes objects using integer k and integer stream nums._2) int add(int val) inserts Vals ...

1. Title 1. Title Description Given two arrays of integers nums1 and nums2 in ascending order, and an integer k k k. Define a pair of values ( u , ...

Title: the car starts from the starting point to the destination, which is located at the target mile east of the starting position. There are gas stations along the way. Each station[i] represents a gas station. It is located at station[i][0] miles east of the starting position, and there are station[i][1] liters of gasoline. Suppose that ...

181. Employees who exceed the manager's income Employee The table contains all employees, and their managers belong to employees. Every employee has one Id，In addition, there is a list of managers corresponding to employees Id. +----+-------+--------+-----------+ | Id | Name | Salary | ManagerId | +----+-------+--------+-----------+ | 1 | ...

384. Medium difficulty: Method 1: Violence: time complexity O(n^2) space complexity O(n) Topic meaning: the topic requires us to implement a constructor and two methods of the Solution class 1. Solution(int[] nums) initializes the object with an integer array nums // Title passed in array nums public Solution(int[] nums) { // Array and n ...

The title requires the k-largest element in the array. My most direct idea is to sort the whole array and then return the k-largest element in the array. 1. Bubble sorting To complete the sorting of the array nums, bubble sorting requires nums.size() - 1 round of sorting, because the last element does not need to be sorted. Bubble sort e ...

Refer to the brushing order: Force deduction brushing sequence This article makes a self summary, summarizes their own ideas when doing problems and the official ideas for solving problems. 485 maximum number of consecutive 1 It's a very simple question, so there's nothing to say. Put a code. class Solution { public int findMaxCons ...

LeetCode notes: Biweekly Contest 62 1. Topic 1 1. Problem solving ideas2. Code implementation 2. Topic 2 1. Problem solving ideas2. Code implementation 3. Topic 3 1. Problem solving ideas2. Code implementation 4. Topic 4 1. Problem solving ideas2. Code implementation 1. Topic 1 The test question link given in questi ...

35. Search insertion positionhttps://leetcode-cn.com/problems/search-insert-position/ Simple difficulty 1103 Given a sort array and a target value, find the target value in the array and return its index. If the target value does not exist in the array, returns the position where it will be inserted in order. Please use a time complexity of ...