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:
[159, 271, 473, 31, 27, 126, 320, 353, 71, 432, 214, 249, 440, 266, 170, 185, 324, 398, 399, 23]
Answer:
[159, 271, 23, 31, 27, 126, 320, 353, 71, 432, 214, 249, 440, 266, 170, 185, 324, 398, 399, 473]