Update longestSubstringWithoutRepeatingCharacters.md

azl397985856 · web-flow · commit 4fef02be8505 · 2018-03-30T17:27:51.000+08:00
diff --git a/longestSubstringWithoutRepeatingCharacters.md b/longestSubstringWithoutRepeatingCharacters.md
@@ -1,5 +1,22 @@
 ## 题目描述
+Given a string, find the length of the longest substring without repeating characters.
 
+Examples:
+
+Given "abcabcbb", the answer is "abc", which the length is 3.
+
+Given "bbbbb", the answer is "b", with the length of 1.
+
+Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
 ## 思路
 
 ## 代码
+```js
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var lengthOfLongestSubstring = function(s) {
+    
+};
+```
