update

Author: stupidjoey

165.py

@@ -0,0 +1,47 @@
+class Solution:
+    # @param {string} version1
+    # @param {string} version2
+    # @return {integer}
+    def compareVersion(self, version1, version2):
+        version1_len = len(version1)
+        version2_len = len(version2)
+        
+        v1 = 0
+        endmark1 = 1
+        sub_version1 = ""
+        if version1_len > 0:
+            for idx1 in range(version1_len):
+                if version1[idx1] == '.':
+                    endmark1 = 0
+                    break
+            if endmark1 == 1:
+                idx1 += 1
+            v1 = int(version1[0:idx1])
+            sub_version1 = version1[idx1+1:]
+        
+        v2 = 0 
+        endmark2 = 1
+        sub_version2 = ""
+        if version2_len > 0:
+            for idx2 in range(version2_len):
+                if version2[idx2] == '.':
+                    endmark2 = 0
+                    break
+            if endmark2 == 1:
+                idx2 += 1
+            v2 = int(version2[0:idx2])
+            sub_version2 = version2[idx2+1:]
+        
+        if v1 > v2 :
+            return 1
+        elif v1 < v2 :
+            return -1
+        else:
+            if endmark1 == 1 and endmark2 == 1 :
+                return 0 
+            else:
+                return self.compareVersion(sub_version1,sub_version2)
+                
+        
+        
+        

28.py

@@ -0,0 +1,17 @@
+class Solution:
+    # @param {string} haystack
+    # @param {string} needle
+    # @return {integer}
+    def strStr(self, haystack, needle):
+        needle_len = len(needle)
+        if needle_len == 0:
+            return 0
+        
+        for idx in range(0, len(haystack)-needle_len + 1):
+            substr = haystack[idx:idx+needle_len]
+            if substr == needle:
+                return idx
+                
+        return -1
+            
+        

3.py

@@ -0,0 +1,16 @@
+class Solution:
+    # @param {string} s
+    # @return {integer}
+    def lengthOfLongestSubstring(self, s):
+        stack = []
+        max_sublen = 0
+        for c in s:
+            if c not in stack:
+                stack.append(c)
+                max_sublen = max(max_sublen, len(stack))
+            else:
+                idx = stack.index(c)
+                stack = stack[idx+1:]
+                stack.append(c)
+        return max_sublen
+                

71.py

@@ -0,0 +1,28 @@
+class Solution:
+    # @param {string} path
+    # @return {string}
+    def simplifyPath(self, path):
+        stack = []
+        pathset = path.split('/')
+        for p in pathset:
+            if p == '':
+                pass
+            elif p == '.':
+                pass
+            elif p == '..':
+                if len(stack) > 0:
+                    stack.pop()
+                else:
+                    pass
+            else:
+                stack.append(p)
+        
+        simple_path = ''
+        if len(stack) > 0:
+            for p in stack:
+                simple_path += '/' + p
+            return simple_path
+        else:
+            return '/'
+            
+