7 problems solved.

lintcoder · lintcoder · commit cd67d2398ca7 · 2022-03-12T20:30:49.000+08:00
diff --git a/src/1846.cpp b/src/1846.cpp
@@ -0,0 +1,15 @@
+int maximumElementAfterDecrementingAndRearranging(vector<int>& arr) {
+        int len = arr.size();
+        sort(arr.begin(), arr.end());
+        
+        arr[0] = 1;
+        for (int i = 1; i < len; ++i)
+        {
+            if (arr[i] > arr[i-1]+1)
+            {
+                arr[i] = arr[i-1]+1;
+            }
+        }
+        
+        return arr[len-1];
+    }
diff --git a/src/2023.cpp b/src/2023.cpp
@@ -0,0 +1,24 @@
+int numOfPairs(vector<string>& nums, string target) {
+        int len = nums.size();
+        int targetlen = target.size();
+        vector<int> sz_vec(len, 0);
+        for (int i = 0; i < len; ++i)
+            sz_vec[i] = nums[i].size();
+        
+        int ct = 0;
+        for (int i = 0; i < len-1; ++i)
+        {
+            for (int j = i+1; j < len; ++j)
+            {
+                if (sz_vec[i] + sz_vec[j] == targetlen)
+                {
+                    if (nums[i] + nums[j] == target)
+                        ct += 1;
+                    if (nums[j] + nums[i] == target)
+                        ct += 1;
+                }
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/2058.cpp b/src/2058.cpp
@@ -0,0 +1,38 @@
+vector<int> nodesBetweenCriticalPoints(ListNode* head) {
+        ListNode* pre = head, *cur = head->next, *post = head->next->next;
+        int lastindex = -1, nextindex = -1, firstindex = -1;
+        int n = 1;
+        int mindist = 1e5;
+        while (post != nullptr)
+        {
+            if ((cur->val < pre->val && cur->val < post->val)
+                || (cur->val > pre->val && cur->val > post->val))
+            {
+                lastindex = nextindex;
+                nextindex = n;
+                if (lastindex == -1)
+                {
+                    firstindex = n;
+                }
+                else
+                {
+                    int dist = nextindex - lastindex;
+                    if (dist < mindist)
+                        mindist = dist;
+                }
+            }
+            pre = cur;
+            cur = post;
+            post = post->next;
+            ++n;
+        }
+        
+        vector<int> res(2, -1);
+        if (lastindex != -1 && nextindex != -1)
+        {
+            res[0] = mindist;
+            res[1] = nextindex - firstindex;
+        }
+        
+        return res;
+    }
diff --git a/src/2109.cpp b/src/2109.cpp
@@ -0,0 +1,25 @@
+string addSpaces(string s, vector<int>& spaces) {
+        int sz = s.size();
+        int len = spaces.size();
+        int n = sz + len;
+        int i = 0, j = 0, k = 0;
+        
+        string res(n, ' ');
+        while (i < n && j < len)
+        {
+            if (i < spaces[j]+j)
+            {
+                res[i++] = s[k++];
+            }
+            else
+            {
+                ++i;
+                ++j;
+            }
+        }
+
+        if (i < n)
+            copy(s.begin()+k, s.end(), res.begin()+i);
+        
+        return res;
+    }
diff --git a/src/2185.cpp b/src/2185.cpp
@@ -0,0 +1,18 @@
+int prefixCount(vector<string>& words, string pref) {
+        int len = words.size();
+        int n = pref.size();
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int j = 0;
+            for (j = 0; j < n; ++j)
+            {
+                if (words[i][j] != pref[j])
+                    break;
+            }
+            if (j == n)
+                ++ct;
+        }
+        
+        return ct;
+    }
diff --git a/src/2190.cpp b/src/2190.cpp
@@ -0,0 +1,21 @@
+int mostFrequent(vector<int>& nums, int key) {
+        int len = nums.size();
+        int target = 0, maxnum = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int tmp = nums[i], ct = 0;
+            for (int j = 0; j < len-1; ++j)
+            {
+                if (nums[j] == key && nums[j+1] == tmp)
+                    ++ct;
+            }
+
+            if (ct > maxnum)
+            {
+                target = tmp;
+                maxnum = ct;
+            }
+        }
+        
+        return target;
+    }
diff --git a/src/2194.cpp b/src/2194.cpp
@@ -0,0 +1,19 @@
+vector<string> cellsInRange(string s) {
+        int m = s[4]-s[1]+1;
+        int n = s[3]-s[0]+1;
+        int sum = m*n;
+        
+        vector<string> res(sum, "  ");
+        int k = 0;
+        for (int i = 0; i < n; ++i)
+        {
+            for (int j = 0; j < m; ++j)
+            {
+                res[k][0] = s[0]+i;
+                res[k][1] = s[1]+j;
+                ++k;
+            }
+        }
+        
+        return res;
+    }
