#输出字符串最后一个字符的长度
s = 'Show me your code'
j = 0
for i in s[-1::-1]:
if i != ' ':
j += 1
else:
break
print(j)
#输出一句话中最长单词的第一个单词和长度
def longestLetter(s):
s = s.split()
word = s[0]
word_len = len(s[0])
for i in s:
if len(i)>word_len:
word = s[i]
word_len = len(s[i])
return (word,word_len)
print(longestLetter('Show me your code'))
#给定一个字符串,找出不含有重复字符的最长子串的长度
def longestStr(s):
res = []
temp = ''
for i in s:
if i not in temp:
temp += i
else:
res.append(temp)
temp = ''
temp += i
sort_res = sorted(res,key=len)
return len(sort_res[-1])
print(longestStr("pwwkew"))
print(longestStr("abcabcbb"))
print(longestStr("bbbbb"))
#计数连续二进制子串长度
def zeroOne(s):
temp = 1
res = []
for i in range(1,len(s)):
if i==len(s):
break
if s[i]==s[i-1]:
temp += 1
else:
#temp += 1
res.append(temp)
temp = 1
res.append(temp)
return res
print(zeroOne('0110001111'))