5 problems solved.

lintcoder · lintcoder · commit 384f316b5e71 · 2023-07-07T21:01:01.000+08:00
diff --git a/src/2729.cpp b/src/2729.cpp
@@ -0,0 +1,20 @@
+bool isFascinating(int n) {
+        if (n > 333)
+            return false;
+        string s1 = to_string(n);
+        string s2 = to_string(n*2);
+        string s3 = to_string(n*3);
+
+        int arr[11] = {0}; 
+        for (int i = 0; i < 3; ++i)
+        {
+            arr[s1[i]-'0']++;
+            arr[s2[i]-'0']++;
+            arr[s3[i]-'0']++;
+            if (arr[s1[i]-'0'] > 1 || arr[s2[i]-'0'] > 1 || arr[s3[i]-'0'] > 1
+                || s1[i]-'0' == 0 || s2[i]-'0' == 0 || s3[i]-'0' == 0)
+                return false;
+        }
+
+        return true;
+    }
diff --git a/src/2733.cpp b/src/2733.cpp
@@ -0,0 +1,47 @@
+int findNonMinOrMax(vector<int>& nums) {
+        int len = nums.size();
+        if (len <= 2)
+            return -1;
+        
+        int minval = 101, maxval = 0;
+        int ct = 0;
+        int res = 0;
+
+        for (int i = 0; i < len; ++i)
+        {
+            if (nums[i] < minval)
+            {
+                if (minval != 101)
+                {
+                    ++ct;
+                    if (ct == 2)
+                    {
+                        res = minval;
+                        break;
+                    }
+                }
+                minval = nums[i];
+            }
+            if (nums[i] > maxval)
+            {
+                if (maxval != 0)
+                {
+                    ++ct;
+                    if (ct == 2)
+                    {
+                        res = maxval;
+                        break;
+                    }
+                }
+                maxval = nums[i];
+            }
+
+            if (nums[i] != minval && nums[i] != maxval)
+            {
+                res = nums[i];
+                break;
+            }
+        }
+
+        return res;
+    }
diff --git a/src/2744.cpp b/src/2744.cpp
@@ -0,0 +1,25 @@
+int maximumNumberOfStringPairs(vector<string>& words) {
+        int len = words.size();
+        int ct = 0;
+        vector<int> flag(len, 0);
+
+        for (int i = 0; i < len-1; ++i)
+        {
+            if (flag[i] == 1)
+                continue;
+            for (int j = i+1; j < len; ++j)
+            {
+                if (flag[i] == 0)
+                {
+                    if (words[i][0] == words[j][1] && words[i][1] == words[j][0])
+                    {
+                        ++ct;
+                        flag[i] = 1;
+                        flag[j] = 1;
+                    }
+                }
+            }
+        }
+
+        return ct;
+    }
diff --git a/src/2745.cpp b/src/2745.cpp
@@ -0,0 +1,5 @@
+int longestString(int x, int y, int z) {
+        int common = x < y ? x : y;
+        int diff = x > common ? 1 : (y > common ? 1 : 0);
+        return (common*2 + diff + z) * 2;
+    }
diff --git a/src/2748.cpp b/src/2748.cpp
@@ -0,0 +1,48 @@
+int countBeautifulPairs(vector<int>& nums) {
+        int len = nums.size();
+        int ct = 0;
+        vector<vector<int>> digits(len, {0,0});
+
+        for (int i = 0; i != len; ++i)
+        {
+            int x = nums[i]%10;
+            int y = nums[i];
+            while (y >= 10)
+            {
+                y /= 10;
+            }
+            digits[i][1] = x;
+            digits[i][0] = y;
+            if (x%2 == 0)
+                digits[i][1] = 2;
+            if (x%3 == 0)
+                digits[i][1] = 3;
+            if (x == 6)
+                digits[i][1] = 6;
+            if (y%2 == 0)
+                digits[i][0] = 2;
+            if (y%3 == 0)
+                digits[i][0] = 3;
+            if (y == 6)
+                digits[i][0] = 6;
+        }
+
+        for (int i = 0; i < len-1; ++i)
+        {
+            for (int j = i+1; j < len; ++j)
+            {
+                if ((digits[i][0] == 2 && digits[j][1] == 2) || (digits[i][0] == 2 && digits[j][1] == 6))
+                ;
+                else if ((digits[i][0] == 3 && digits[j][1] == 3) || (digits[i][0] == 3 && digits[j][1] == 6))
+                ;
+                else if ((digits[i][0] == 6 && digits[j][1] == 2) || (digits[i][0] == 6 && digits[j][1] == 3) || (digits[i][0] == 6 && digits[j][1] == 6))
+                ;
+                else if ((digits[i][0] == digits[j][1]) && digits[i][0] != 1)
+                ;
+                else
+                    ++ct;
+            }
+        }
+
+        return ct;
+    }
