update

Author: dunwu

README.md

@@ -25,7 +25,8 @@
 - [图](docs/data-structure/graph.md)
 - [堆](docs/data-structure/heap.md)
 - [散列表](docs/data-structure/hash.md)
-
+- [字典树](docs/data-structure/trie.md)
+  
 ### 算法
 
 - [排序](docs/algorithm/sort.md)

assets/数据结构.eddx

@@ -22,4 +22,12 @@
     <maven.compiler.source>${java.version}</maven.compiler.source>
     <maven.compiler.target>${java.version}</maven.compiler.target>
   </properties>
+
+  <dependencies>
+    <dependency>
+      <groupId>io.github.dunwu</groupId>
+      <artifactId>data-structure</artifactId>
+      <version>1.0.0</version>
+    </dependency>
+  </dependencies>
 </project>

assets/list.eddx assets/链表.eddxassets/list.eddx renamed to assets/链表.eddx

@@ -0,0 +1,38 @@
+package io.github.dunwu.algorithm.dynamic;
+
+import io.github.dunwu.tool.util.ArrayUtil;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+/**
+ * @author <a href="mailto:forbreak@163.com">Zhang Peng</a>
+ * @since 2020-03-06
+ */
+public class MaxSubArray {
+
+    private static final Logger log = LoggerFactory.getLogger(MaxSubArray.class);
+
+    public static int maxSubArray(int[] nums) {
+        int[] result = new int[nums.length];
+        result[0] = nums[0];
+        int max = nums[0];
+        for (int i = 1; i < nums.length; i++) {
+            result[i] = Math.max(result[i - 1] + nums[i], nums[i]);
+            if (max < result[i]) {
+                max = result[i];
+            }
+
+            if (log.isDebugEnabled()) {
+                log.debug(ArrayUtil.toString(result));
+            }
+        }
+        return max;
+    }
+
+    public static void main(String[] args) {
+        int[] array = new int[] { -2, 1, -3, 4, -1, 2, 1, -5, 4 };
+        int max = MaxSubArray.maxSubArray(array);
+        System.out.println("max = " + max);
+    }
+
+}

codes/algorithm/pom.xml

@@ -0,0 +1,7 @@
+/**
+ * 动态规划算法
+ *
+ * @author <a href="mailto:forbreak@163.com">Zhang Peng</a>
+ * @since 2020-03-06
+ */
+package io.github.dunwu.algorithm.dynamic;

codes/algorithm/src/main/java/io/github/dunwu/algorithm/array/TwoSum.java

@@ -1,6 +1,6 @@
 package io.github.dunwu.algorithm.search;
 
-import io.github.dunwu.algorithm.util.ArrayUtil;
+import io.github.dunwu.tool.util.ArrayUtil;
 import org.slf4j.Logger;
 import org.slf4j.LoggerFactory;
 
@@ -21,7 +21,7 @@ public SearchStrategy(Search search) {
 
     public int find(Integer[] list, int key) {
         logger.info(this.search.getClass().getSimpleName() + " 查找开始：");
-        logger.info("要查找的线性表：{}", ArrayUtil.getArrayString(list, 0, list.length - 1));
+        logger.info("要查找的线性表：{}", ArrayUtil.toString(list));
         logger.info("要查找的 key：{}", key);
 
         int index = this.search.find(list, key);

codes/algorithm/src/main/java/io/github/dunwu/algorithm/dynamic/MaxSubArray.java

@@ -31,7 +31,7 @@
 
   <!-- LOGGER BEGIN -->
   <!-- 本项目的日志记录，分级打印 -->
-  <logger name="io.github.dunwu" level="INFO" additivity="false">
+  <logger name="io.github.dunwu" level="DEBUG" additivity="false">
     <appender-ref ref="ALL" />
     <appender-ref ref="STDOUT" />
   </logger>