目录调整

xiaokexiang · Dec 13, 2021 · 3bfed10 · 3bfed10
1 parent ef85be1
commit 3bfed10
Show file tree

Hide file tree

Showing 2 changed files with 22 additions and 17 deletions.
diff --git a/.../common/algorithm/DynamicProgramming.java → ...algorithm/classic/DynamicProgramming.java b/.../common/algorithm/DynamicProgramming.java → ...algorithm/classic/DynamicProgramming.java
@@ -1,4 +1,4 @@
-package io.spring.common.algorithm;
+package io.spring.common.algorithm.classic;
 
 /**
  * @author xiaokexiang
@@ -54,25 +54,35 @@ public static void run(int p) {
         int[] w = new int[]{0, 1, 4, 3};
         // 表示前i个商品的，背包容量为j的最大价值
         int[][] val = new int[v.length][p + 1];
-
+        int[][] path = new int[v.length][p + 1];
         for (int i = 1; i < v.length; i++) {
             for (int j = 1; j < val[i].length; j++) {
                 if (w[i] > j) {
                     val[i][j] = val[i - 1][j];
                 } else {
-                    val[i][j] = Math.max(val[i - 1][j], v[i] + val[i - 1][j - w[i]]);
+                    if (val[i - 1][j] > v[i] + val[i - 1][j - w[i]]) {
+                        val[i][j] = val[i - 1][j];
+                    } else {
+                        // 需要记录最优解
+                        val[i][j] = v[i] + val[i - 1][j - w[i]];
+                        path[i][j] = 1;
+                    }
                 }
             }
         }
 
-        // 打印结果
-        for (int i = 0; i < v.length; i++) {
-            for (int j = 0; j < val[i].length; j++) {
-                System.out.print(val[i][j] + " ");
+        // 打印商品放入的结果
+
+        int i = val.length - 1;
+        int j = val[0].length - 1;
+
+        while(i > 0 & j > 0) {
+            if (path[i][j] == 1) {
+                System.out.printf("第%d个商品放入背包中\n", i);
+                j = j - w[i];
             }
-            System.out.println();
+            i--;
         }
-
     }
 
     public static void main(String[] args) {

diff --git a/...o/spring/common/algorithm/string/Kmp.java → .../common/algorithm/classic/KmpMatcher.java b/...o/spring/common/algorithm/string/Kmp.java → .../common/algorithm/classic/KmpMatcher.java
@@ -1,9 +1,4 @@
-package io.spring.common.algorithm.string;
-
-import org.springframework.util.StringUtils;
-
-import java.lang.reflect.Parameter;
-import java.util.Arrays;
+package io.spring.common.algorithm.classic;
 
 /**
  * @author xiaokexiang
@@ -24,7 +19,7 @@
  * 模式串移动后：       A  B  A  B  A  A  A  B  A  B
  * 主串与模式串在下表为3的A值处不匹配，那么需要将位置为next[i](next[3]=1)的模式串值(即A)与当前主串不匹配的位置(索引3)继续开始匹配
  */
-public class Kmp {
+public class KmpMatcher {
 
     /**
      * 获取next数组（即与主串不匹配时模式串移动的索引）
@@ -95,6 +90,6 @@ public static int indexOf(char[] parent, char[] child) {
     public static void main(String[] args) {
         char[] parent = {'A', 'B', 'B', 'A', 'A', 'B', 'A', 'B', 'A', 'A', 'B', 'A'};
         char[] child = {'B', 'A', 'A'};
-        System.out.println(Kmp.indexOf(parent, child));
+        System.out.println(KmpMatcher.indexOf(parent, child));
     }
 }