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 input: [1,45,67,43,58,98,41,34,57]
Example output: [98,45,67,43,58,1,41,34,57]
Example explanation: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.
Q: [339, 229, 429, 239, 321, 334, 115, 36, 456, 269, 402, 483, 230, 453, 378, 262, 299, 227, 238, 268]
A:
[339, 229, 429, 239, 321, 334, 115, 483, 456, 269, 402, 36, 230, 453, 378, 262, 299, 227, 238, 268]