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.

[63, 76, 415, 162, 264, 208, 139, 178, 100, 93, 368, 360, 491, 420, 392, 58, 301, 366, 430, 445]
Output:
[63, 76, 415, 162, 264, 208, 139, 178, 100, 93, 368, 360, 58, 420, 392, 491, 301, 366, 430, 445]