Dynamic Programming

Continued: [README2] Fibonacci sequence of dynamic programming shows how to solve the overlapping subproblem The change problem explains the optimal substructure lLeetCode 509: change exchange (1) What is the optimal substructure In fact, the substructure refers to the subproblem, but to be theUTF-8...

Posted by **tito** on *Tue, 18 May 2021 02:39:36 +0930*

The sequence of continuous positive numbers with sword finger Offer 57 - II. And s Title: input a positive integer target, output all the continuous positive integer sequences with sum of target (at least two numbers). The numbers in the sequence are arranged from small to large, and different UTF-8...

Posted by **changeback** on *Sat, 22 May 2021 03:44:02 +0930*

Date: 7:43 PM, Tuesday, May 25, 2021 Personal brush question record, code collection, source is leetcode After a lot of discussion and consultation, I'm going to work towards Java The main answer language is Java Title: The sword finger offers 60. N dice Medium difficulty 235 Throw n dice on tUTF-8...

Posted by **nadeemshafi9** on *Wed, 26 May 2021 03:09:12 +0930*

1. Preface This article is the third tree DP blog written by the author. It reviews and summarizes the algorithm of tree DP, and sweeps the blind spot at the same time. DP project - learning notes: tree DP(2021/2/25)DP special topic - special training: tree DP(2021/2/28)DP topic - algorithm blUTF-8...

Posted by **Imad** on *Thu, 27 May 2021 02:39:59 +0930*

Change DP change root d p one like Of three step Suddenly General three steps of changing root dp There are three steps to change dp Select any node as the rootStatistics subtree (bottom-up) contribution to each root node(top down) count the contribution of the parent node to the child node andUTF-8...

Posted by **nuttycoder** on *Fri, 04 Jun 2021 03:55:02 +0930*

1. Backtracking algorithm Backtrace algorithm, recommend watching video first, b station Search and backtrace algorithm 1 The classic question is the whole permutation Selecting m (m < n) elements from n different elements and arranging them in a certain order is called taking out M elements frUTF-8...

Posted by **ecljc** on *Mon, 07 Jun 2021 04:55:33 +0930*

dijkstra labeling method for single source shortest path If you only need the code, please move to the following 1, dijkstra algorithm introduction complete version 1. Definition overview Dijkstra algorithm is a typical single source shortest path algorithm, which is used to calculate the shortUTF-8...

Posted by **oakld** on *Wed, 23 Jun 2021 04:40:16 +0930*

Selected lectures on classic topics (3) Topic 1: how to change money Title Description: given array arr, all values in arr are integers and do not repeat. Each value represents a currency with a face value, and each currency with a face value can use any piece of money. Given an integer aim, whUTF-8...

Posted by **imawake** on *Tue, 29 Jun 2021 03:00:23 +0930*

21 days master dynamic planning First of all, I think I have to figure out what the Dynamic Planning algorithm is really? The above picture is taken from the definition of dynamic planning in Baidu Encyclopedia. I personally think it has the following characteristics: Similar to the dividing meUTF-8...

Posted by **MajorMo** on *Sat, 03 Jul 2021 04:00:27 +0930*

[APIO2018] Duathlon Triathlon Luogu portal If you haven't studied the round square tree, you can enter my blog Learning records and examples of square tree Thinking of solving problems First of all, this is an undirected graph counting problem, so we consider computing on a square tree After buUTF-8...

Posted by **AceE** on *Mon, 12 Jul 2021 08:10:26 +0930*