Open AccessSolving Double Counting Problems with Dynamic Programming Algorithm
Author(s) -
Wenrong Jiang
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1746/1/012058
Subject(s) - longest common subsequence problem , dynamic programming , scope (computer science) , computer science , algorithm , subsequence , dynamic problem , mathematical optimization , theoretical computer science , mathematics , programming language , mathematical analysis , bounded function
In view of the repetitive calculation problems that often appear in algorithmic questions, this paper analyzes the common thought methods and dynamic programming for solving such problems. Through several types of classic questions, such as the backpack problem, the longest common subsequence, etc., the analysis methods and scope of application of dynamic programming are summarized.