# Alphabetical Substrings
# Assume s is a string of lower case characters.
# Write a program that prints the longest substring of s in
# which the letters occur in alphabetical order.
# For example, if s = ‘azcbobobegghakl’, then print
# Longest substring in alphabetical order is: beggh
# Alphabetical Substrings# Assume s is a string of lower case characters.# Write a program that prints the longest substring of s in # which the letters occur in alphabetical order. # For example, if s = 'azcbobobegghakl', then print# Longest substring in alphabetical order is: begghs = raw_input('Please input a string \n')counter = 0i = 0length = len(s)temp = s[0]substr = s[0]while (i<=length-1):if s[i]<s[i+1]:temp += s[i+1]counter += 1elif s[i]>s[i+1]:if len(substr)<len(temp):substr = temptemp = s[i+1]i = i + 1if len(temp)>len(substr):substr = tempprint 'Longest substring in alphabetical order is:',substr
，临行之前，面对太多的疑问和不解：为何是一个人？
