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.

[328, 399, 81, 127, 466, 77, 360, 489, 346, 413, 406, 359, 431, 197, 26, 451, 120, 237, 443, 427]
Output:
[328, 399, 81, 127, 466, 77, 360, 26, 346, 413, 406, 359, 431, 197, 489, 451, 120, 237, 443, 427]