6 problems solved.

lintcoder · lintcoder · commit c02693004390 · 2021-12-18T14:07:05.000+08:00
diff --git a/src/1886.cpp b/src/1886.cpp
@@ -0,0 +1,66 @@
+bool findRotation(vector<vector<int>>& mat, vector<vector<int>>& target) {
+        int row = mat.size();
+        bool flag = true;
+        
+        for (int r = 0; r < row; ++r)
+        {
+            for (int c = 0; c < row; ++c)
+            {
+                if (mat[r][c] != target[r][c])
+                {
+                    flag = false;
+                    break;
+                }
+            }
+        }
+        
+        if (!flag)
+        {
+            flag = true;
+            for (int r = 0; r < row; ++r)
+            {
+                for (int c = 0; c < row; ++c)
+                {
+                    if (mat[r][c] != target[row-1-r][row-1-c])
+                    {
+                        flag = false;
+                        break;
+                    }
+                }
+            }
+        }
+        
+        if (!flag)
+        {
+            flag = true;
+            for (int r = 0; r < row; ++r)
+            {
+                for (int c = 0; c < row; ++c)
+                {
+                    if (mat[r][c] != target[row-1-c][r])
+                    {
+                        flag = false;
+                        break;
+                    }
+                }
+            }
+        }
+        
+        if (!flag)
+        {
+            flag = true;
+            for (int r = 0; r < row; ++r)
+            {
+                for (int c = 0; c < row; ++c)
+                {
+                    if (mat[r][c] != target[c][row-1-r])
+                    {
+                        flag = false;
+                        break;
+                    }
+                }
+            }
+        }
+        
+        return flag;
+    }
diff --git a/src/2078.cpp b/src/2078.cpp
@@ -0,0 +1,16 @@
+int maxDistance(vector<int>& colors) {
+        int maxdist = 0;
+        int len = colors.size();
+        for (int i = 0; i < len-1; ++i)
+        {
+            for (int j = i+1; j < len; ++j)
+            {
+                if (colors[i] != colors[j])
+                {
+                    maxdist = j-i > maxdist ? j-i : maxdist;
+                }
+            }
+        }
+        
+        return maxdist;
+    }
diff --git a/src/2085.cpp b/src/2085.cpp
@@ -0,0 +1,21 @@
+int countWords(vector<string>& words1, vector<string>& words2) {
+        int len1 = words1.size();
+        int len2 = words2.size();
+        
+        map<string, int> mp1, mp2;
+        for (int i = 0; i < len1; ++i)
+            mp1[words1[i]]++;
+        for (int i = 0; i < len2; ++i)
+            mp2[words2[i]]++;
+        
+        int ct = 0;
+        for (auto iter = mp1.begin(); iter != mp1.end(); ++iter)
+        {
+            if (iter->second == 1 && mp2[iter->first] == 1)
+            {
+                ++ct;
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/2089.cpp b/src/2089.cpp
@@ -0,0 +1,17 @@
+vector<int> targetIndices(vector<int>& nums, int target) {
+        int len = nums.size();
+        int arr[101] = {0};
+        for (int i = 0; i < len; ++i)
+            arr[nums[i]]++;
+        
+        if (arr[target] == 0)
+            return {};
+        
+        vector<int> res(arr[target], 0);
+        int ct = 0;
+        ct = accumulate(arr, arr+target, ct);
+        for (int i = 0; i < arr[target]; ++i)
+            res[i] = ct+i;
+        
+        return res;
+    }
diff --git a/src/2099.cpp b/src/2099.cpp
@@ -0,0 +1,32 @@
+vector<int> maxSubsequence(vector<int>& nums, int k) {
+        struct Elem
+        {
+            int val;
+            int pos;
+            Elem(int v = 0, int p = 0):val(v),pos(p){}
+        };
+        
+        int len = nums.size();
+        vector<Elem> vec(len, Elem());
+        for (int i = 0; i < len; ++i)
+        {
+            vec[i].val = nums[i];
+            vec[i].pos = i;
+        }
+        
+        auto cmp = [](const Elem& a, const Elem& b) {
+            return (a.val < b.val) || (a.val == b.val && a.pos < b.pos);
+        };
+        auto cmp2 = [](const Elem& a, const Elem& b) {
+            return a.pos < b.pos;
+        };
+        
+        sort(vec.begin(), vec.end(), cmp);
+        sort(vec.begin()+len-k, vec.end(), cmp2);
+        
+        vector<int> res(k, 0);
+        for (int i = 0; i < k; ++i)
+            res[i] = vec[i+len-k].val;
+        
+        return res;   
+    }
diff --git a/src/2103.cpp b/src/2103.cpp
@@ -0,0 +1,26 @@
+int countPoints(string rings) {
+        vector<vector<int>> flag{10, {0,0,0}};
+        int len = rings.size();
+        
+        int i = 0;
+        while (i < len)
+        {
+            int pos = rings[i+1]-'0';
+            if (rings[i] == 'R')
+                flag[pos][0] = 1;
+            else if (rings[i] == 'G')
+                flag[pos][1] = 1;
+            else
+                flag[pos][2] = 1;
+            i += 2;
+        }
+        
+        int ct = 0;
+        for (int i = 0; i < 10; ++i)
+        {
+            if (flag[i][0] == 1 && flag[i][1] == 1 && flag[i][2] == 1)
+                ++ct;
+        }
+        
+        return ct;
+    }
