You will be given a definition of a task first, then some input of the task.
In this task, you are given a list of unique integers you need to swap the positions of maximum and minimum element in the list and return the updated list.

[224, 469, 451, 462, 389, 258, 265, 276, 470, 366, 128, 432, 36, 133, 159, 213, 317, 467, 248, 89]
Output:
[224, 469, 451, 462, 389, 258, 265, 276, 36, 366, 128, 432, 470, 133, 159, 213, 317, 467, 248, 89]