给你列表,请你反转列表,并返回反转后的列表
code:
class Solution:
ListNode = [1, 2, 3, 4, 5]
AfterList = []
# 反向方法
def reverseList(self):
self.ListNode.reverse()
return self.ListNode
# 遍历方法
def reverseList01(self):
for i in range(len(self.ListNode)):
value = self.ListNode.pop()
self.AfterList.append(value)
return self.AfterList
# 递归方法
def reverseList02(self,n):
if len(self.ListNode) > 0:
value = self.ListNode.pop()
self.AfterList.append(value)
self.reverseList02(n-1)
return self.AfterList
if __name__ == "__main__":
s = Solution()
print(s.reverseList())