Programmer Think

Summary of dynamic programming of leetcode 3 1 - house raiding Title Link: Title Link stamp here!!! Idea: the idea of this question is not difficult, but we need to pay attention to the details. Recurrence formula: DP [i] = max (DP [I-1], DP [I-2] + num [i]) class Solution { public int rob(int[] nums) { if(nums.length==1){ ...

1, Introduction to the characteristic principle of ROPS (rotational projection statistics)   in this article, we continue to learn how to use the PCL:: ropestimate class to extract the features of points. The feature extraction method implemented in this class is written by Yulan Guo, ferdous sohel, Mohammed bennamon, min Lu and Jianwei w ...

2.7 ​​​​​​1405. Longest happy string If the string does not contain any strings such as' aaa ',' bbb 'or' ccc 'as substrings, the string is a "happy string". Here are three integers a, b and c. please return any string s that meets all the following conditions: s is a happy string as long as possible. There are at most a letters' ...

Link Title: https://codeforces.com/contest/1525/problem/D Main idea of the title: 0,1 sequence of numbers, a[i]=0 or 1. The number of 1 must not exceed half of n. We need to pair all 1s with a 0. A 0 can only be paired with a 1 ifandPairing will consumeResources. What is the minimum total resource consumption after all 1s are paired? Solutio ...

1, The idea of selecting sorting method: first take out the smallest (large) element, then take out the smallest (large) element in the remaining elements, and select the smallest (large) element among the unprocessed elements for sorting each time. 1. Two ideas: ① open up a new array space and put the smallest (large) elements in the new arr ...

E - POJ1915 Knight Moves: Background Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?The Problem Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another, so that you have the ...

1. Sorting principle Quick sort is an exchange sort method of binary tree structure proposed by Hoare in 1962. Its basic idea is: any element in the element sequence to be sorted is taken as the reference value, and the set to be sorted is divided into two subsequences according to the sort code. All elements in the left subsequence are less t ...

Monotonous stack Monotone: therefore, the data stored in the monotone stack should be orderly, so the monotone stack is also divided into monotone increasing stack and monotone decreasing stack. Monotonically increasing stack: monotonically increasing stack is from the bottom of the stack to the top of the stack, and the data is from ...

Problem description f(x)=x*sin(x)+1, x belongs to [0,2 π]. Taking solving the maximum and minimum value of f(x) as an example, a genetic algorithm program for f(x) is designed, and then run to solve it (1) Determine the basic functions: this experiment is to solve the maximum and minimum values of f (x). (2) Encoding f(x): a chromosome ...

Research on consistent HASH algorithm Contributor: underground Stalker 1. Introduction When studying the CRUSH algorithm of distributed storage Ceph, I saw the article introduce that it is a special consistency HASH algorithm, so I began to study the consistency HASH algorithm, make early preparation, and found that the concept is indeed clo ...