Programming VIP

Title address Leetcode 746. Climb stairs with minimum cost Title Description Give you an integer array cost, where cost[i] is the cost of climbing up the ith step of the stairs. Once you pay this fee, you can choose to climb up one or two steps. You can choose to climb the stairs from the steps with subscript 0 or subscript 1. Please calc ...

Convenient for self review == 1.01 Backpack Problem Description: there are n valuable items and a backpack with a volume of v. there is one for each item. Calculate the maximum value of the items that the backpack can hold. Analysis process: 1. Describe the state: we use f [i] [j] to indicate that only the first I items are selected, and th ...

Catalogue of series articles I Array type problem solving method 1: dichotomy II Array type problem solving method 2: Double finger needle method III Array type problem solving method 3: sliding window IV Array type problem solving method 4: simulation V The basic operation and classic topics of the linked list Vi Classic title of hash tab ...

1706. Where does the ball meet Problem solution Title Source: 1706. Where does the ball meet 2022.02.24 one question per day Daily question column address: LeetCode daily problem solution is being updated ❤️💕 Today's topic is easier. After solving the problem, I'll pack my bags and go back to school tomorrow. I hope it's easy tomorrow, heh ...

Definition from Wikipedia The travelling salesman problem (also called the travelling salesperson problem or TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" Recently, in order to ...

Question 1: Question 617 of force deduction Problem solving ideas: reference This article The code is as follows: class Solution { public TreeNode mergeTrees(TreeNode root1, TreeNode root2) { if(root1 == null) { return root2; } if(root2 == null) { return root1; } TreeNode r ...

subject analysis This is a typical example of dynamic programming. The optimal substructure should be selected at each step, that is, the lattice that can get the most gold coins. Here are two ideas to solve this problem: backtracking and dp array. These two ideas can be said to find the optimal solution in the opposite way, one from top t ...

Experimental environment Windows 10+DEV-C++ dynamic programming Dynamic programming is a hot topic in algorithm design and analysis. If the optimal solution of a problem (usually the maximum or minimum value) is required, and the problem can be decomposed into several problems, and there are overlapping subproblems between small problems ...

LeetCode problem solution - dynamic programming - subsequence problem Reference: labuladong WeChat official account, hand handle brush, dynamic programming series, official account, excellent public address, recommended to everyone. In this paper, we will pick up the routine of sub sequence problem. In fact, there are two kinds of templ ...

1. Problem Description: Niuniu is playing a CF game. The game time is T minutes. There are N questions. You can submit the code at any time during the game time. The score of question I is maxPoints[i]. The score of question I decreases by pointsPerMinute[i] per minute with the progress of the game. This is a CF game of dark. The score may be ...