add 3 & 5 & 7

Author: codeestX

.gitignore

@@ -25,6 +25,7 @@ wheels/
 .installed.cfg
 *.egg
 .DS_Store
+/.idea
 
 # PyInstaller
 #  Usually these files are written by a python script from a template

003/longest_substring_without_repeating_characters.py

@@ -0,0 +1,24 @@
+class Solution(object):
+    def lengthOfLongestSubstring(self, s):
+        """
+        :type s: str
+        :rtype: int
+        """
+        result = 0
+        index = 0
+        while len(s) is not 0:
+            temp = list()
+            for c in s:
+                if c in temp:
+                    index = s.find(c)
+                    if len(temp) > result:
+                        result = len(temp)
+                    break
+                else:
+                    temp.append(c)
+            if len(temp) == len(s) and len(temp) > result:
+                result = len(temp)
+            s = s[index + 1:len(s)]
+            if len(s) < result:
+                break
+        return result

005/longest_palindromic_substring.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def longestPalindrome(self, s):
+        """
+        :type s: str
+        :rtype: str
+        """
+        result = s[0:1]
+        length = len(s)
+        while length > 0:
+            for i in range(0, len(s) - length + 1):
+                temp = s[i:i + length]
+                if self.is_palindromic(temp) and len(temp) > len(result):
+                    result = temp
+            length -= 1
+        return result
+
+    def is_palindromic(self, s):
+        return s == s[::-1]

007/reverse_integer.py

@@ -0,0 +1,9 @@
+class Solution(object):
+    def reverse(self, x):
+        """
+        :type x: int
+        :rtype: int
+        """
+        pos = 1 if x >= 0 else -1
+        x = str(abs(x))[::-1]
+        return int(x) * pos if int(x) <= pow(2, 31) else 0