用递归写的,显得有点复杂了,有没有更简洁的递归写法呀?
Topic source一种递归写法:
# recursion
def trim(s):
if len(s) > 0 and s[0] == ' ':
s = trim(s[1:])
elif len(s) > 0 and s[-1] == ' ':
s = trim(s[:-1])
return s
- 1
一种递归写法:
# recursion
def trim(s):
if len(s) > 0 and s[0] == ' ':
s = trim(s[1:])
elif len(s) > 0 and s[-1] == ' ':
s = trim(s[:-1])
return s
ksahgfiwhi
def trim(s):
if s == '':
return s
elif s == ' ':
s = ''
return s
else:
if s[0] == ' ':
s = s[1:]
s = trim(s)
if s == '':
return s
elif s[-1] == ' ' :
s = s[:-1]
s = trim(s)
return s