小傅哥 | 动态规划

fuzhengwei · fuzhengwei · commit 279fb53d7d26 · 2020-03-18T10:24:31.000+08:00
diff --git a/Dynamic Programming/Longest Substring Without Repeating Characters/README.md b/Dynamic Programming/Longest Substring Without Repeating Characters/README.md
@@ -0,0 +1,28 @@
+# 无重复字符的最长子串
+给定一个字符串，请你找出其中不含有重复字符的 最长子串 的长度。
+
+**示例 1: **
+
+```
+输入: "abcabcbb"
+输出: 3 
+解释: 因为无重复字符的最长子串是 "abc"，所以其长度为 3。
+```
+
+**示例 2:**
+
+输入: "bbbbb"
+```
+输出: 1
+解释: 因为无重复字符的最长子串是 "b"，所以其长度为 1。
+示例 3:
+```
+
+**输入: "pwwkew"**
+
+```
+输出: 3
+解释: 因为无重复字符的最长子串是 "wke"，所以其长度为 3。
+     请注意，你的答案必须是 子串 的长度，"pwke" 是一个子序列，不是子串。
+```
+
diff --git a/Dynamic Programming/Longest Substring Without Repeating Characters/code.js b/Dynamic Programming/Longest Substring Without Repeating Characters/code.js
@@ -1,18 +1,18 @@
 // import visualization libraries {
-const { Tracer, Array1DTracer,LogTracer, Array2DTracer, ChartTracer, Randomize, Layout, VerticalLayout } = require('algorithm-visualizer');
+const {Tracer, Array1DTracer, LogTracer, Array2DTracer, ChartTracer, Randomize, Layout, VerticalLayout} = require('algorithm-visualizer');
 // }
 
 // define tracer variables {
-const array2dTracer = new Array1DTracer('Array');
+const tracer = new Array1DTracer('Array');
 const logger = new LogTracer('无重复字符的最长子串');
 
-Layout.setRoot(new VerticalLayout([array2dTracer,logger]));
+Layout.setRoot(new VerticalLayout([array2dTracer, logger]));
 // }
 
 var s = "ababcabcdabcdeabcdefabac";
 
 (function main() {
-    array2dTracer.set(s);
+    tracer.set(s);
 
     var beginIdx = 0, endIdx = 0, maxSize = 0;
     for (var i = 0; i < s.length; i++) {
@@ -21,13 +21,15 @@ var s = "ababcabcdabcdeabcdefabac";
 
         var existIdx = s.indexOf(s.charAt(i), beginIdx);
         if (existIdx < endIdx) {
-            array2dTracer.select(beginIdx, i-1);
-
+            tracer.select(beginIdx, i - 1);
+            tracer.patch(i);
             beginIdx = existIdx + 1;
 
             Tracer.delay();
-            array2dTracer.deselect(0, beginIdx);
+            tracer.deselect(0, beginIdx);
+            tracer.depatch(i);
 
+            logger.println('碰撞长度：' + (endIdx - beginIdx + 1));
         }
 
         var e = endIdx - beginIdx + 1;
@@ -38,6 +40,6 @@ var s = "ababcabcdabcdeabcdefabac";
 
     }
 
-    logger.println(maxSize);
+    tracer.println('最长长度：' + maxSize);
 
 })();
