1 result = s[::-1]
1 l = list(s) 2 l.reverse() 3 result = "".join(l) 4 或者: 5 l = list(s) 6 result = "".join(l[::-1])
1 result = reduce(lambda x,y:y+x,s)
1 def func(s): 2 if len(s) <1: 3 return s 4 return func(s[1:])+s[0] 5 result = func(s)
1 def func(s): 2 l = list(s) #模拟全部入栈 3 result = "" 4 while len(l)>0: 5 result += l.pop() #模拟出栈 6 return result 7 result = func(s)
1 def func(s): 2 result = "" 3 max_index = len(s)-1 4 for index,value in enumerate(s): 5 result += s[max_index-index] 6 return result 7 result = func(s)
原文:https://www.cnblogs.com/chitangyuanlai/p/10725601.html