Longest Substring Without Repeating Characters

Author: tanjiasheng

Longest Substring Without Repeating Characters/index.js

@@ -0,0 +1,25 @@
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var lengthOfLongestSubstring = function (s) {
+    const cleanStr = [...new Set(s)].join('');
+    let cleanStrLen = cleanStr.length;
+
+    while (cleanStrLen) {
+        for (let i = 0; i <= s.length - cleanStrLen; i++) {
+            const subStr = s.substr(i, cleanStrLen);
+
+            if (!subStr.split('').some((char, i) => subStr.indexOf(char) !== i)) {
+                return cleanStrLen;
+            }
+        }
+
+        cleanStrLen--;
+    }
+
+    return 0;   
+};
+
+
+console.log(lengthOfLongestSubstring('pwwkew'))

Longest Substring Without Repeating Characters/readme.md

@@ -0,0 +1 @@
+先去重，然后最长的情况下不重复的子串就是去重后字符串的长度N，如果找不到的话依次递减(N--)，找到输入字符串的子串中有没有存在长度N的不重复字符串