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.

[227, 268, 136, 332, 349, 445, 83, 444, 359, 52, 403, 258, 263, 405, 431, 86, 287, 446, 126, 105]
Output:
[227, 268, 136, 332, 349, 445, 83, 444, 359, 446, 403, 258, 263, 405, 431, 86, 287, 52, 126, 105]