ehlxr/budd
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

update at 2021-11-01 10:07:28 by ehlxr

Browse Source
This commit is contained in:
ehlxr
2021-11-01 10:07:28 +08:00
parent d51106271e
commit 78d8ad252b
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
budd-common/src/main/java/io/github/ehlxr/algorithm/DynamicProgramming.java → budd-common/src/main/java/io/github/ehlxr/algorithm/dp/FindMaxSum.java
View File

@@ -22,17 +22,17 @@
* THE SOFTWARE. * THE SOFTWARE.
*/ */
package io.github.ehlxr.algorithm; package io.github.ehlxr.algorithm.dp;
/** /**
* 在一个数组 arr 中，找出一组不相邻的数字，使得最后的和最大 * 在一个数组 arr 中，找出一组不相邻的数字，使得最后的和最大
* * <p>
* 图解 https://cdn.jsdelivr.net/gh/0vo/oss/images/dp.jpg * 图解 https://cdn.jsdelivr.net/gh/0vo/oss/images/dp.jpg
* *
* @author ehlxr * @author ehlxr
* @since 2021-10-31 22:46. * @since 2021-10-31 22:46.
*/ */
public class DynamicProgramming { public class FindMaxSum {
public static int recOpt(int[] arr, int i) { public static int recOpt(int[] arr, int i) {
if (i == 0) { if (i == 0) {
return arr[0]; return arr[0];