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: [64, 35, 266, 412, 289, 233, 485, 316, 384, 425, 129, 297, 105, 74, 353, 197, 473, 89, 164, 163]
A: 
[64, 485, 266, 412, 289, 233, 35, 316, 384, 425, 129, 297, 105, 74, 353, 197, 473, 89, 164, 163]