HTMLify
day24.py
Views: 5 | Author: prakhardoneria
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | class Solution: def largestSwap(self, s): s_list = list(s) n = len(s) sorted_s = sorted(s_list, reverse=True) for i in range(n): if s_list[i] != sorted_s[i]: target_digit = sorted_s[i] for j in range(n - 1, i, -1): if s_list[j] == target_digit: s_list[i], s_list[j] = s_list[j], s_list[i] return "".join(s_list) return s |