Update kth-smallest-amount-with-single-denomination-combination.py

kamyu104 · Apr 14, 2024 · a475a04 · a475a04
1 parent b2edc17
commit a475a04
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/Python/kth-smallest-amount-with-single-denomination-combination.py b/Python/kth-smallest-amount-with-single-denomination-combination.py
@@ -1,4 +1,4 @@
-# Time:  O(n * 2^n * (log(mx) + log(k * mn))) = O(n * 2^n *  logk), mn = min(coins), mx = max(coins)
+# Time:  O(n * 2^n * (log(mx) + log(k * mn))) = O(n * 2^n * logk), mn = min(coins), mx = max(coins)
 # Space: O(2^n)
 
 import itertools
@@ -43,7 +43,7 @@ def binary_search(left, right, check):
         return binary_search(mn, k*mn, check)
 
 
-# Time:  O(n * 2^n * (log(mx) + log(k * mn))) = O(n * 2^n *  logk), mn = min(coins), mx = max(coins)
+# Time:  O(n * 2^n * (log(mx) + log(k * mn))) = O(n * 2^n * logk), mn = min(coins), mx = max(coins)
 # Space: O(2^n)
 # binary search, principle of inclusion and exclusion, number theory
 class Solution2(object):