8 problems solved.

lintcoder · lintcoder · commit a262417b0119 · 2021-10-31T18:45:33.000+08:00
diff --git a/src/1897.cpp b/src/1897.cpp
@@ -0,0 +1,20 @@
+bool makeEqual(vector<string>& words) {
+        int len = words.size();
+        int num[26] = {0};
+        for (int i = 0; i < len; ++i)
+        {
+            int sz = words[i].size();
+            for (int j = 0; j < sz; ++j)
+            {
+                ++num[words[i][j]-'a'];
+            }
+        }
+        
+        for (int i = 0; i < 26; ++i)
+        {
+            if (num[i]%len != 0)
+                return false;
+        }
+        
+        return true;
+    }
diff --git a/src/1945.cpp b/src/1945.cpp
@@ -0,0 +1,29 @@
+int getLucky(string s, int k) {
+        const int val[26] = {1,2,3,4,5,6,7,8,9,
+                            1,2,3,4,5,6,7,8,9,10,
+                            2,3,4,5,6,7,8};
+        int len = s.size();
+        int sum = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            sum += val[s[i]-'a'];
+        }
+        if (sum < 10)
+            return sum;
+        
+        while (--k)
+        {
+            int tmp = 0;
+            while (sum > 0)
+            {
+                tmp += sum%10;
+                sum /= 10;
+            }
+            
+            sum = tmp;
+            if (sum < 10)
+                break;
+        }
+        
+        return sum;
+    }
diff --git a/src/1952.cpp b/src/1952.cpp
@@ -0,0 +1,12 @@
+bool isThree(int n) {
+        int num[25] = {2,3,5,7,11,13,17,19,23,29,31,
+                    37,41,43,47,53,59,61,67,71,73,
+                    79,83,89,97};
+        for (int i = 0; i < 25; ++i)
+        {
+            if (num[i]*num[i] == n)
+                return true;
+        }
+        
+        return false;
+    }
diff --git a/src/1957.cpp b/src/1957.cpp
@@ -0,0 +1,30 @@
+string makeFancyString(string s) {
+        int len = s.size();
+        if (len < 3)
+            return s;
+        
+        stringstream ss;
+        int ct = 1;
+        int lastchar = s[0];
+        int i = 1;
+        ss << s[0];
+        while (i < len)
+        {
+            if (s[i] == lastchar)
+            {
+                ++ct;
+                if (ct < 3)
+                    ss << s[i];
+                ++i;
+            }
+            else
+            {
+                ct = 1;
+                lastchar = s[i];
+                ss << s[i];
+                ++i;
+            }
+        }
+        
+        return ss.str();
+    }
diff --git a/src/1961.cpp b/src/1961.cpp
@@ -0,0 +1,25 @@
+bool isPrefixString(string s, vector<string>& words) {
+        int len = words.size();
+        int sz = s.size();
+        int k = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int len2 = words[i].size();
+            if (len2 > sz-k)
+                return false;
+            for (int j = 0; j < len2; ++j)
+            {
+                if (words[i][j] != s[k])
+                    return false;
+                else
+                    ++k;
+            }
+            if (k == sz)
+                break;
+        }
+        
+        if (k < sz)
+            return false;
+        
+        return true;
+    }
diff --git a/src/2027.cpp b/src/2027.cpp
@@ -0,0 +1,17 @@
+int minimumMoves(string s) {
+        int len = s.size();
+        int i = 0;
+        int ct = 0;
+        while (i < len)
+        {
+            if (s[i] == 'O')
+                ++i;
+            else
+            {
+                ++ct;
+                i += 3;
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/2053.cpp b/src/2053.cpp
@@ -0,0 +1,20 @@
+string kthDistinct(vector<string>& arr, int k) {
+        map<string, int> mp;
+        int len = arr.size();
+        for (int i = 0; i < len; ++i)
+            mp[arr[i]]++;
+        
+        int ct = 1;
+        for (int i = 0; i < len; ++i)
+        {
+            if (mp[arr[i]] == 1)
+            {
+                if (ct == k)
+                    return arr[i];
+                else
+                    ++ct;
+            }
+        }
+        
+        return "";
+    }
diff --git a/src/2057.cpp b/src/2057.cpp
@@ -0,0 +1,10 @@
+int smallestEqual(vector<int>& nums) {
+        int len = nums.size();
+        for (int i = 0; i < len; ++i)
+        {
+            if (i%10 == nums[i])
+                return i;
+        }
+        
+        return -1;
+    }
