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.

Let me give you an example: [1,45,67,43,58,98,41,34,57]
The answer to this example can be: [98,45,67,43,58,1,41,34,57]
Here is why: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

OK. solve this:
[146, 354, 466, 465, 481, 390, 64, 176, 347, 420, 459, 386, 299, 468, 15, 161, 18, 422, 300, 188]
Answer:
[146, 354, 466, 465, 15, 390, 64, 176, 347, 420, 459, 386, 299, 468, 481, 161, 18, 422, 300, 188]