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.

[314, 122, 249, 424, 38, 90, 272, 426, 97, 476, 491, 340, 312, 34, 311, 405, 438, 433, 301, 206]
Output:
[314, 122, 249, 424, 38, 90, 272, 426, 97, 476, 34, 340, 312, 491, 311, 405, 438, 433, 301, 206]