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: [128, 249, 389, 83, 380, 314, 51, 289, 383, 247, 133, 336, 391, 41, 312, 497, 306, 349, 255, 488]
A:
[128, 249, 389, 83, 380, 314, 51, 289, 383, 247, 133, 336, 391, 497, 312, 41, 306, 349, 255, 488]