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]: [319, 207, 24, 411, 458, 337, 145, 59, 387, 265, 199, 326, 262, 313, 282, 136, 310, 351, 42, 385]
[A]: [319, 207, 458, 411, 24, 337, 145, 59, 387, 265, 199, 326, 262, 313, 282, 136, 310, 351, 42, 385]

[Q]: [147, 345, 70, 396, 326, 125, 55, 221, 43, 223, 122, 241, 374, 372, 487, 210, 488, 276, 308, 218]
[A]: [147, 345, 70, 396, 326, 125, 55, 221, 488, 223, 122, 241, 374, 372, 487, 210, 43, 276, 308, 218]

[Q]: [265, 475, 341, 442, 418, 161, 53, 69, 485, 331, 436, 450, 144, 455, 98, 488, 333, 273, 221, 51]
[A]:
[265, 475, 341, 442, 418, 161, 53, 69, 485, 331, 436, 450, 144, 455, 98, 51, 333, 273, 221, 488]