6 problems solved.

lintcoder · lintcoder · commit fb3318f43705 · 2022-09-17T20:07:48.000+08:00
diff --git a/src/2336.cpp b/src/2336.cpp
@@ -0,0 +1,35 @@
+class SmallestInfiniteSet {
+public:
+    SmallestInfiniteSet() {
+        for(int i = 0; i < 1001; ++i)
+            arr[i] = 1;
+        curSmallest = 1;
+    }
+    
+    int popSmallest() {
+        int rt = curSmallest;
+        arr[curSmallest] = 0;
+        for(int i = rt+1; i <= 1000; ++i)
+        {
+            if(arr[i] == 1)
+            {
+                curSmallest = i;
+                break;
+            }
+        }
+        
+        return rt;
+    }
+    
+    void addBack(int num) {
+        if(num <= 1000 && arr[num] == 0)
+        {
+            arr[num] = 1;
+            if(num < curSmallest)
+                curSmallest = num;
+        }
+    }
+private:
+    int arr[1001];
+    int curSmallest;
+};
diff --git a/src/2373.cpp b/src/2373.cpp
@@ -0,0 +1,24 @@
+vector<vector<int>> largestLocal(vector<vector<int>>& grid) {
+        int row = grid.size();
+        int n = row-2;
+        vector<vector<int>> res(n, vector<int>(n, 0));
+        
+        for (int i = 1; i < row-1; ++i)
+        {
+            for (int j = 1; j < row-1; ++j)
+            {
+                int maxvalue = 0;
+                for (int p = i-1; p <= i+1; ++p)
+                {
+                    for (int q = j-1; q <= j+1; ++q)
+                    {
+                        if (grid[p][q] > maxvalue)
+                            maxvalue = grid[p][q];
+                    }
+                }
+                res[i-1][j-1] = maxvalue;
+            }
+        }
+        
+        return res;
+    }
diff --git a/src/2390.cpp b/src/2390.cpp
@@ -0,0 +1,26 @@
+string removeStars(string s) {
+        int len = s.size();
+        string res(len, ' ');
+        
+        int i = 0, j = 0;
+        while (i < len)
+        {
+            if(s[i] != '*')
+            {
+                res[j++] = s[i];
+            }
+            else
+            {
+                if(j > 0)
+                {
+                    --j;
+                }
+            }
+            
+            ++i;
+        }
+        
+        res.resize(j);
+        
+        return res;
+    }
diff --git a/src/2399.cpp b/src/2399.cpp
@@ -0,0 +1,18 @@
+bool checkDistances(string s, vector<int>& distance) {
+        int len = s.size();
+        vector<int> indexarr(26, -1);
+        for (int i = 0; i < len; ++i)
+        {
+            if (indexarr[s[i]-'a'] == -1)
+            {
+                indexarr[s[i]-'a'] = i;
+            }
+            else
+            {
+                if ((abs(indexarr[s[i]-'a']-i)-1) != distance[s[i]-'a'])
+                    return false;
+            }
+        }
+        
+        return true;
+    }
diff --git a/src/2404.cpp b/src/2404.cpp
@@ -0,0 +1,29 @@
+int mostFrequentEven(vector<int>& nums) {
+        int len = nums.size();
+        map<int, int> mp;
+        
+        for (int i = 0; i < len; ++i)
+        {
+            if (nums[i]%2 == 0)
+                mp[nums[i]]++;
+        }
+        
+        int maxnum = 0, val = 0;
+        for (auto iter = mp.begin(); iter != mp.end(); ++iter)
+        {
+            if (iter->second > maxnum)
+            {
+                maxnum = iter->second;
+                val = iter->first;
+            }
+            else if (iter->second == maxnum && iter->first < val)
+            {
+                val = iter->first;
+            }
+        }
+        
+        if (maxnum == 0)
+            return -1;
+        else
+            return val;
+    }
diff --git a/src/2405.cpp b/src/2405.cpp
@@ -0,0 +1,23 @@
+int partitionString(string s) {
+        int len = s.size();
+        int i = 0;
+        int ct = 0;
+        
+        while (i < len)
+        {
+            vector<int> flag(26, 0);
+            ++ct;
+            while (i < len)
+            {
+                if (flag[s[i]-'a'] == 0)
+                {
+                    flag[s[i]-'a'] = 1;
+                    ++i;
+                }
+                else
+                    break;     
+            }
+        }
+        
+        return ct;
+    }
