# Dynamic Programming

## Interview questions of dynamic programming of leetcode

1. Maximum sum of continuous subarrays Enter an integer a...

## Dynamic Planning - Example 6. Polygon Game

1. Title Description A Polygon game is a one-...

## Dynamic Planning - Example 7. Image Compression

1. Title Description A digitized image is an n*n array of pixels. Assuming that each pixel has a gray value of 0-255, it...

## The sixth sort -- quick sort

void quickSort(vector&lt;int&gt;&amp; v, int left, int right) { if (left &gt;= right)return; int pirot = v[right]; int l...

## LeetCode 1320. The second refers to the minimum distance of input -- Dynamic Programming -- interval DP

The second refers to the minimum distance entered The layout of the two finger input method customized keyboard on the ...

## Dynamic programming --- example 6. Polygon game

1, Title Description Polygon game is a single...

## Sword finger Offer 19. Detailed problem solution of regular expression matching

Sword finger Offer 19. Regular expression matching ...

## Summary of algorithm and question types of dynamic programming

Dynamic Programming (DP) It is understood that a large pr...

## 2021-10-02 comparison of wrong and correct ideas for climbing stairs with minimum cost

stem First put the correct answe...

## kuangbin_ac automata

preface k u a n g b i n kuangbin kuangbin's ...

## Three programming questions of Huawei autumn machine test (2021-09-08)

Notice: HUAWEI, Ali's latest autumn test written test questions, ideas and reference codes have been arranged well in We...

## leetcode 5869. Maximum product of two palindrome subsequence lengths [shape pressure DP]

Give you a string s. please find two disjoint palindrome subsequences in s to maximize the product of their lengths. Two...

## Dynamic programming -- Examples

Problem solving ideas of dynamic planning: There are four steps: 1 create a new one-dimensional array or two-dimensional...