Update maximum-product-after-k-increments.cpp

kamyu104 · web-flow · commit fa8ffd5f4086 · 2022-04-11T04:14:41.000+08:00
diff --git a/C++/maximum-product-after-k-increments.cpp b/C++/maximum-product-after-k-increments.cpp
@@ -52,13 +52,15 @@ class Solution2 {
             ++cnt[x];
             min_num = min(min_num, x);
         }
-        for (; k; --k) {
-            --cnt[min_num];
-            ++cnt[min_num + 1];
+        while (k) {
+            const auto c = min(cnt[min_num], k);
+            cnt[min_num] -= c;
+            cnt[min_num + 1] += c;
             if (!cnt[min_num]) {
                 cnt.erase(min_num);
                 ++min_num;
             }
+            k -= c;
         }
         return accumulate(cbegin(cnt), cend(cnt), 1ull,
                           [=](const auto& total, const auto& x) {

Original file line number	Diff line number	Diff line change
`@@ -52,13 +52,15 @@ class Solution2 {`
`52`	`52`	`++cnt[x];`
`53`	`53`	`min_num = min(min_num, x);`
`54`	`54`	`}`
`55`		`- for (; k; --k) {`
`56`		`- --cnt[min_num];`
`57`		`- ++cnt[min_num + 1];`
	`55`	`+ while (k) {`
	`56`	`+ const auto c = min(cnt[min_num], k);`
	`57`	`+ cnt[min_num] -= c;`
	`58`	`+ cnt[min_num + 1] += c;`
`58`	`59`	`if (!cnt[min_num]) {`
`59`	`60`	`cnt.erase(min_num);`
`60`	`61`	`++min_num;`
`61`	`62`	`}`
	`63`	`+ k -= c;`
`62`	`64`	`}`
`63`	`65`	`return accumulate(cbegin(cnt), cend(cnt), 1ull,`
`64`	`66`	`[=](const auto& total, const auto& x) {`