Shulou(Shulou.com)05/31 Report--

This article mainly introduces the relevant knowledge of how to use the java dynamic planning method, the content is detailed and easy to understand, the operation is simple and fast, and it has a certain reference value. I believe you will gain something after reading this article on how to use the java dynamic planning method. Let's take a look.

Description

1. Dynamic programming is a programming principle, which can be solved by dividing very complex problems into smaller sub-problems.

2. This principle is similar to recursion, but different from recursion, each different sub-problem can only be solved once.

Use proc

Determine the recursive relationship that is suitable for the above problems.

The initial value of the initial memory, array, matrix.

Make sure that when we make a recursive call (where we can access the answer to the subquestion), it is always resolved ahead of time.

Example

Public class dpSolution {static int getValue (int [] values, int rodLength) {int [] subSolutions = new int [rodLength + 1]; for (int I = 1; I

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.