6 problems solved.

lintcoder · lintcoder · commit 5489bff922d5 · 2022-05-28T20:28:28.000+08:00
diff --git a/src/2244.cpp b/src/2244.cpp
@@ -0,0 +1,27 @@
+int minimumRounds(vector<int>& tasks) {
+        map<int, int> mp;
+        int len = tasks.size();
+        for (int i = 0; i < len; ++i)
+        {
+            mp[tasks[i]]++;
+        }
+        
+        int ct = 0;
+        for (auto& kv : mp)
+        {
+            if (kv.second < 2)
+                return -1;
+            else if (kv.second%2 == 0)
+            {
+                int n = kv.second/3;
+                ct += n%2 == 0 ? n+(kv.second-n*3)/2 : n-1+(kv.second-(n-1)*3)/2;
+            }
+            else
+            {
+                int n = kv.second/3;
+                ct += n%2 == 1 ? n+(kv.second-n*3)/2 : n-1+(kv.second-(n-1)*3)/2;
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/2259.cpp b/src/2259.cpp
@@ -0,0 +1,23 @@
+string removeDigit(string number, char digit) {
+        int len = number.size();
+        int pos = len;
+        for (int i = 0; i < len; ++i)
+        {
+            if (number[i] == digit)
+            {
+                pos = i;
+                if (i < len-1 && number[i] < number[i+1])
+                    break;
+            }
+        }
+        
+        string res(len-1, ' ');
+        int k = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (i != pos)
+                res[k++] = number[i];
+        }
+        
+        return res;
+    }
diff --git a/src/2264.cpp b/src/2264.cpp
@@ -0,0 +1,46 @@
+string largestGoodInteger(string num) {
+        int len = num.size();
+        int i = 1, ct = 1;
+        char c = num[0];
+        char goodchar = ' ';
+        
+        while (i < len)
+        {
+            if (num[i] == c)
+            {
+                ++ct;
+                if (ct == 3)
+                {
+                    if (goodchar == ' ')
+                        goodchar = c;
+                    else if (c > goodchar)
+                        goodchar = c;
+                    
+                    int j = i+1;
+                    while (j < len && num[j] == c)
+                        ++j;
+                    if (j == len)
+                        break;
+                    else
+                    {
+                        c = num[j];
+                        ct = 1;
+                        i = j+1;
+                    }
+                }
+                else
+                    ++i;
+            }
+            else
+            {
+                c = num[i];
+                ct = 1;
+                ++i;
+            }
+        }
+        
+        if (goodchar != ' ')
+            return string(3, goodchar);
+        else
+            return "";
+    }
diff --git a/src/2269.cpp b/src/2269.cpp
@@ -0,0 +1,23 @@
+int divisorSubstrings(int num, int k) {
+        string s = to_string(num);
+        int len = s.size();
+        
+        int i, ct = 0;
+        int sum = 0;
+        for (i = 0; i < k; ++i)
+            sum = sum*10 + s[i]-'0';
+        
+        if (sum > 0 && num%sum == 0)
+            ++ct;
+        i = 0;
+        int coef = pow(10, k-1);
+        for (int j = k; j < len; ++j)
+        {
+            sum = (sum - (s[i]-'0')*coef)*10 + s[j]-'0';
+            if (sum > 0 && num%sum == 0)
+                ++ct;
+            ++i;
+        }
+        
+        return ct;
+    }
diff --git a/src/2278.cpp b/src/2278.cpp
@@ -0,0 +1,11 @@
+int percentageLetter(string s, char letter) {
+        int len = s.size();
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (s[i] == letter)
+                ++ct;
+        }
+        
+        return ct*100/len;
+    }
diff --git a/src/2279.cpp b/src/2279.cpp
@@ -0,0 +1,28 @@
+int maximumBags(vector<int>& capacity, vector<int>& rocks, int additionalRocks) {
+        int len = capacity.size();
+        vector<int> lessvec(len, 0);
+        
+        for (int i = 0; i < len; ++i)
+        {
+            lessvec[i] = capacity[i]-rocks[i];
+        }
+        
+        sort(lessvec.begin(), lessvec.end());
+        
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (lessvec[i] == 0)
+                ++ct;
+            else
+            {
+                if (additionalRocks >= lessvec[i])
+                {
+                    additionalRocks -= lessvec[i];
+                    ++ct;
+                }
+            }
+        }
+        
+        return ct;
+    }
