#1505

Minimum Possible Integer After at Most K Adjacent Swaps On Digits

master · 1675 · lc hard +32 · verified · 41.1% accepted · 499 likes · top 21%

Description

A very large integer is represented as a string num. You may perform at most k swaps of adjacent digits. Return the lexicographically smallest integer obtainable, as a string.

Example 1:

Input: num = "4321", k = 4

Output: "1342"

Explanation: The steps to obtain the minimum integer from 4321 with 4 adjacent swaps are shown.

Example 2:

Input: num = "100", k = 1

Output: "010"

Explanation: It's ok for the output to have leading zeros, but the input is guaranteed not to have any leading zeros.

Example 3:

Input: num = "36789", k = 1000

Output: "36789"

Explanation: We can keep the number without any swaps.

Code

1

2

3

class Solution:
    def minInteger(self, num: str, k: int) -> str:

class Solution:
    def minInteger(self, num: str, k: int) -> str: