def trim(s):
while s[:1] == ' ' or s[-1:] == ' ':
if s[:1] == ' ':
s = s[1:]
if s[-1:] == ' ':
s = s[0:-1]
return s
和递归思路是一样的， 只不过我个人觉得递归理解起来比较绕……
Sign in to make a reply
xin-烁
def trim(s):
while s[:1] == ' ' or s[-1:] == ' ':
if s[:1] == ' ':
s = s[1:]
if s[-1:] == ' ':
s = s[0:-1]
return s