Add Solution.py for 0003.Longest Substring Without Repeating Characters

Hinsteny · Hinsteny · commit 332e04ead191 · 2019-06-20T13:48:00.000+08:00
diff --git a/solution/0003.Longest Substring Without Repeating Characters/Solution.py b/solution/0003.Longest Substring Without Repeating Characters/Solution.py
@@ -0,0 +1,12 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str):
+        max = 0
+        length = len(s)
+        substr = ""
+        for i in range(0, length):
+            index = substr.find(s[i])
+            if index > -1:
+                substr = substr[index + 1:]
+            substr += s[i]
+            max = (max if (max > len(substr)) else len(substr))
+        return max
diff --git a/solution/README.md b/solution/README.md
@@ -25,7 +25,8 @@
 │   ├── README.md
 │   ├── Solution.go
 │   ├── Solution.java
-│   └── Solution.js
+│   ├── Solution.js
+│   └── Solution.py
 ├── 0004.Median of Two Sorted Arrays
 │   ├── README.md
 │   ├── Solution.cpp
