Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
recursion solution in Clear category for Swap Nodes by kalauroma7997
def swap_nodes(a, i=0):
if i >= len(a)-1: return a
a[i], a[i+1] = a[i+1], a[i]
return swap_nodes(a, i+2)
if __name__ == '__main__':
print("Example:")
#print(list(swap_nodes([1, 2, 3, 4])))
# These "asserts" are used for self-checking and not for an auto-testing
#assert list(swap_nodes([1, 2, 3, 4])) == [2, 1, 4, 3]
#assert list(swap_nodes([5, 5, 5, 5])) == [5, 5, 5, 5]
assert list(swap_nodes([1, 2, 3])) == [2, 1, 3]
#assert list(swap_nodes([3])) == [3]
#assert list(swap_nodes(["hello", "world"])) == ["world", "hello"]
print("Coding complete? Click 'Check' to earn cool rewards!")
Oct. 26, 2020
Comments: