Update minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits.py

Author: kamyu104

Python/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits.py

@@ -28,17 +28,17 @@ def minInteger(self, num, k):
         :type k: int
         :rtype: str
         """
-        lookup = collections.defaultdict(collections.deque)
+        lookup = collections.defaultdict(list)
         bit = BIT(len(num)+1)
-        for i, d in enumerate(num):
+        for i in reversed(xrange(len(num))):
             bit.add(i+1, 1)
-            lookup[int(d)].append(i+1)
+            lookup[int(num[i])].append(i+1)
         result = []
         for _ in xrange(len(num)):
             for d in xrange(10):
-                if lookup[d] and bit.sum(lookup[d][0]-1) <= k:
-                    k -= bit.sum(lookup[d][0]-1)
-                    bit.add(lookup[d].popleft(), -1)
+                if lookup[d] and bit.sum(lookup[d][-1]-1) <= k:
+                    k -= bit.sum(lookup[d][-1]-1)
+                    bit.add(lookup[d].pop(), -1)
                     result.append(d)
                     break
         return "".join(map(str, result))