T面试题

Jack-Lee-Hiter · Jack-Lee-Hiter · commit fcd1f83368c1 · 2016-08-31T22:50:14.000+08:00
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
diff --git a/Target Offer/句子中单词首字母大写.py b/Target Offer/句子中单词首字母大写.py
@@ -0,0 +1,26 @@
+'''
+面试题：
+一个句子的所有单词的首字母大写，其余小写
+'''
+def title(s):
+    if not s:
+        return ""
+    res = ""
+    diff = ord("a") - ord("A")
+    for i in range(1, len(s)):
+        if s[i-1] == " " and s[i] <= "z" and s[i] >= "a":
+            res += chr(ord(s[i]) - diff)
+        elif s[i-1] != " " and s[i] <= "Z" and s[i] >= "A":
+            res += chr(ord(s[i]) + diff)
+        else:
+            res += s[i]
+    if s[0] <= "z" and s[0] >= "a":
+        res = chr(ord(s[0]) - diff) + res
+    else:
+        res = s[0] + res
+    return res
+
+def title2(s):
+    return s.title()
+
+print(title2(" sDsa sddr jki "))
diff --git a/Target Offer/字符串具有相同字符的最长子串.py b/Target Offer/字符串具有相同字符的最长子串.py
@@ -0,0 +1,29 @@
+'''
+求一个字符串的最长子串，其中子串所有字符相同
+面试题
+'''
+def findCommonLCS(s):
+    if not s:
+        return ""
+    if len(s) == 1:
+        return s
+    length = len(s)
+    maxIndex, maxLength = 0, 1
+    curIndex = 0
+    while curIndex < length:
+        tempLength = 1
+        while curIndex + tempLength < length and s[curIndex] == s[curIndex+tempLength]:
+            tempLength += 1
+        if maxLength < tempLength:
+            maxLength = tempLength
+            maxIndex = curIndex
+        if curIndex + tempLength == length:
+            break
+        curIndex += tempLength
+    if maxLength == 1:
+        return s[0]
+    else:
+        res = s[maxIndex:maxIndex+maxLength]
+        return res
+
+print(findCommonLCS("abbbasagsagsgdsaagaaccagcfsccccc"))
