Update minimum-number-of-operations-to-make-string-sorted.cpp

Author: kamyu104

C++/minimum-number-of-operations-to-make-string-sorted.cpp

@@ -1,13 +1,13 @@
 // Time:  O(26 * n) = O(n)
-// Space: O(26) = O(1)
+// Space: O(max_n) = O(max_n)
 
 class Solution {
 public:
     int makeStringSorted(string s) {  // count of prev_permutation
         static const int MOD = 1e9 + 7;
 
         array<int, 26> count = {0};
-        int result = 0, total = 0, comb_total = 1;
+        int result = 0, comb_total = 1;
         for (int i = size(s) - 1; i >= 0; --i) {
             int num = s[i] - 'a';
             comb_total = ((comb_total * int64_t(size(s) - i) % MOD) * inverse(++count[num], MOD)) % MOD;