Given the task definition, example input & output, solve the new input case.
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.
Example: [1,45,67,43,58,98,41,34,57]
Output: [98,45,67,43,58,1,41,34,57]
1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input case for you: [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]