Leetcode problem solving notes for slow ploughing of stupid cattle (dynamic update...)

2022-02-21： Set up a flag. Try to clock in one question every day . But I know it's hard （ After all, I have to work hard to make a living ^-^）, For example, if you encounter a difficult problem, you will probably stand up ( The other day's Leetcode1719 I haven't made it up yet )^-^. Set a small goal first ： labour for 2022 Annual punch in rate 80%.

         Of course , Keep a record of some problem-solving and summary experience at any time , It is also a necessary meaning in the question .

2022-02-21：Leetcode969. Finally give a pass leetcode Based on dynamic programming .DFS、BFS And dynamic programming are general frameworks for solving algorithmic problems . But each has its own specialty, and each has its own best battlefield . How to find the most suitable solution at the first time ？ It is estimated that this can only rely on “ Without it , Only hand ripe ”？

Leetcode279: Complete square (medium, BFS)

Leetcode540: A single element in an ordered array (medium)

Leetcode688: The probability of a knight on the chessboard (medium)

Leetcode688: The probability of a knight on the chessboard (medium, Solution based on probability transfer matrix )

Leetcode717: 1 Bit and 2 Bit characters (simple, Dynamic programming )

Leetcode838: Push domino (medium)

Leetcode969: Pancake sorting (medium, BFS)

Leetcode969: Pancake sorting (medium, DFS)

Leetcode969: Pancake sorting (medium, Dynamic programming ) 

Leetcode1189: “ balloon ” The largest number (simple)

Leetcode1380: The lucky number in the matrix (simple)

Leetcode1791: Find the central node of the star graph (simple)