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:
[147, 345, 70, 396, 326, 125, 55, 221, 43, 223, 122, 241, 374, 372, 487, 210, 488, 276, 308, 218]
Answer:
[147, 345, 70, 396, 326, 125, 55, 221, 488, 223, 122, 241, 374, 372, 487, 210, 43, 276, 308, 218]