Programmer Think

1. Change subject class Solution { public int coinChange(int[] coins, int amount) { int n = coins.length; int[] arr = new int[amount + 1];// 0..amount // Define initial conditions arr[0] = 0; for(int i = 1; i <= amount; i++) { // Find arr[i] arr[i] = Integer.MAX_VALUE; ...

Foreword: making A, B, D and C has been timeout, and I didn't think of how to optimize it. Rating: 1153 + 146 -- > 1299 (green) Don't talk about the problem, just talk about the solution and code. A. Red and Blue Beans   topic type: greed    analysis: if r is less than B, try to replace 1 with more, so calculate the differenc ...

Title address: https://www.luogu.com.cn/problem/P1608 Title Description: The staff quality of "RP restaurant" is not general. After calculating the same phone number, they are ready to let HZH and TZY deliver fast food. They draw a map of the city they live in. It is known that on their map, there are ...

Word splitting (medium) dynamic programming ”Whether leetcode "can be composed and decomposed into - whether" l "is stored in the dictionary and subsequent substrings can be composed when the step size is 1, etc; When the step size is 2, "le" is stored in the dictionary and subsequent substrings can be compose ...

preface Let's first analyze the original LIS problem with Yan dp analysis Strange thief Kidd's glider wing Title Transfer door We can start at any point, and there are two directions: left and right. We have to make the most of the buildings we pass Solution idea: let's take a look at the board problem of the longest body sequence whe ...

0. Origin 0-1 knapsack: max min problem Concept: there are N items in total. The weight of item I (I starts from 1) is w[i], and the value is v[i]. When the total weight does not exceed the upper limit W of the backpack, what is the maximum value that can be loaded into the backpack? Idea: define a two-dimensional array dp to store the ...

Title Link: https://codeforces.com/problemset/problem/149/D Meaning: Given a string s, it is a legal sequence of parentheses. We intend to dye this bracket sequence with the following requirements: There are three conditions for each character: no dyeing, red dyeing and blue dyeingEach pair of matching parentheses has and only one character ...

Title Description Title address: P1896 [SCOI2005] mutual non aggression In N × There are K kings in N's chessboard so that they don't attack each other. How many placement schemes are there. The king can attack one grid in its upper, lower, left, lower, left, lower, right, upper, right and lower eight directions, a total of 8 grids. I ...

C Gym - 102822D analysis: The answer is monotonous and can be divided into two points. Then the focus is on the writing of the judgment function. Let's assume that the answer is X. because this question needs to reduce the bomb by - 1 before it explodes, it's very awkward. Let's first consider the case that the bomb explodes when it reaches 0. ...

[1. House on the street, happy thief No. 1] 198. House raiding (medium) You are a professional thief who plans to steal houses along the street. There is a certain amount of cash hidden in each room. The only restrictive factor affecting your theft is that the adjacent houses are equipped with interconnected anti-theft systems. If two adjacen ...