print("aStr"[::-1])
result = s[::-1]
l = list(s) l.reverse() result = "".join(l)
当然下面也行
l = list(s) result = "".join(l[::-1])
result = reduce(lambda x,y:y+x,s)
def func(s): if len(s) <1: return s return func(s[1:])+s[0] result = func(s)
def func(s): l = list(s) #模拟全部入栈 result = "" while len(l)>0: result += l.pop() #模拟出栈 return result result = func(s)
def func(s): result = "" max_index = len(s)-1 for index,value in enumerate(s): result += s[max_index-index] return result result = func(s)
参考地址:https://www.cnblogs.com/taceywong/p/8045127.html
原文:https://www.cnblogs.com/Fiona-Y/p/10564800.html