Given the task definition and input, reply with output. 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.

[248, 260, 272, 62, 193, 361, 439, 491, 139, 335, 351, 161, 56, 190, 51, 384, 106, 20, 385, 202]

[248, 260, 272, 62, 193, 361, 439, 20, 139, 335, 351, 161, 56, 190, 51, 384, 106, 491, 385, 202]