5 problems solved.

lintcoder · lintcoder · commit 894efd461ed8 · 2022-03-20T16:48:31.000+08:00
diff --git a/src/1525.cpp b/src/1525.cpp
@@ -0,0 +1,36 @@
+int numSplits(string s) {
+        int charNum1[26] = {0};
+        int charNum2[26] = {0};
+        int len = s.size(), ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int idx = s[i]-'a';
+            if (charNum1[idx] == 0)
+            {
+                ++ct;
+            }
+            charNum1[idx]++;
+        }
+        
+        int n = 0, sum = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int idx = s[i]-'a';
+            if (charNum2[idx] == 0)
+            {
+                charNum2[idx] = 1;
+                ++n;
+            }
+            if (charNum1[idx] > 0)
+            {
+                --charNum1[idx];
+                if (charNum1[idx] == 0)
+                    --ct;
+            }
+            
+            if (n == ct)
+                ++sum;
+        }
+        
+        return sum;
+    }
diff --git a/src/1861.cpp b/src/1861.cpp
@@ -0,0 +1,43 @@
+vector<vector<char>> rotateTheBox(vector<vector<char>>& box) {
+        int m = box.size();
+        int n = box[0].size();
+        vector<vector<char>> res(n, vector<char>(m, '.'));
+        
+        for (int i = 0; i < m; ++i)
+        {
+            int col = m-1-i;
+            int j = n-1, k = n-1, idx = n;
+            bool flag = false;
+            while (j >= 0)
+            {
+                if (box[i][j] == '.')
+                {
+                    if (!flag)
+                    {
+                        idx = j;
+                        flag = true;
+                    }
+                }
+                else if (box[i][j] == '*')
+                {
+                    idx = n;
+                    flag = false;
+                    res[k][col] = '*';
+                }
+                else
+                {
+                    if (idx != n)
+                    {
+                        res[idx][col] = '#';
+                        --idx;
+                    }
+                    else
+                        res[k][col] = '#';
+                }
+                --j;
+                --k;
+            }
+        }
+        
+        return res;
+    }
diff --git a/src/2200.cpp b/src/2200.cpp
@@ -0,0 +1,30 @@
+vector<int> findKDistantIndices(vector<int>& nums, int key, int k) {
+        int len = nums.size();
+        vector<int> pos;
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (nums[i] == key)
+            {
+                pos.push_back(i);
+                ++ct;
+            }
+        }
+        
+        vector<int> res;
+        int lh = -1, rh = -1;
+        for (int i = 0; i < ct; ++i)
+        {
+            int l = pos[i]-k > 0 ? pos[i]-k : 0;
+            int r = pos[i]+k < len ? pos[i]+k : len-1;
+            lh = l >= rh+1 ? l : rh+1;
+            rh = r;
+            for (int j = lh; j <= rh; ++j)
+                res.push_back(j);
+            
+            if (rh == len-1)
+                break;
+        }
+        
+        return res;
+    }
diff --git a/src/2206.cpp b/src/2206.cpp
@@ -0,0 +1,16 @@
+bool divideArray(vector<int>& nums) {
+        int arr[501] = {0};
+        int len = nums.size();
+        for (int i = 0; i < len; ++i)
+        {
+            arr[nums[i]]++;
+        }
+        
+        for (int i = 0; i < 501; ++i)
+        {
+            if (arr[i]%2 == 1)
+                return false;
+        }
+        
+        return true;
+    }
diff --git a/src/2210.cpp b/src/2210.cpp
@@ -0,0 +1,26 @@
+int countHillValley(vector<int>& nums) {
+        int len = nums.size();
+        int i = 1;
+        while (i < len-1 && nums[i] == nums[i-1])
+            ++i;
+        if (i == len-1)
+            return 0;
+        
+        int prepos = i-1;
+        int ct = 0;
+        while (i < len)
+        {
+            int j = i;
+            ++i;
+            while (i < len && nums[i] == nums[i-1])
+                ++i;
+            if (i == len)
+                break;
+            if ((nums[j] < nums[prepos] && nums[j] < nums[i])
+               || (nums[j] > nums[prepos] && nums[j] > nums[i]))
+                ++ct;
+            prepos = j;
+        }
+        
+        return ct;
+    }
