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.
Q: [207, 308, 148, 303, 185, 297, 283, 217, 441, 433, 178, 486, 390, 228, 221, 489, 100, 299, 277, 452]
A: 
[207, 308, 148, 303, 185, 297, 283, 217, 441, 433, 178, 486, 390, 228, 221, 100, 489, 299, 277, 452]