[Python] Reverse an array inplace without pointers using recursion in python [closed]

class Solution:
def reverse(self, arr: list, n: int) -> None:
if len(arr)-n>=n-1:
return
arr[len(arr)-n],arr[n-1]=arr[n-1],arr[len(arr)-n]
self.reverse(arr,n-1)
return arr

s=Solution()
print(s.reverse([1,2,3,4,5,6,7],7))


here i uses len() instead of pointer.

So this is a good choice or Is there any problem for using len()?

Continue reading...