9 problems solved.

lintcoder · lintcoder · commit a05fcbeefaad · 2023-02-11T19:42:07.000+08:00
diff --git a/src/2506.cpp b/src/2506.cpp
@@ -0,0 +1,41 @@
+int similarPairs(vector<string>& words) {
+        int len = words.size();
+        vector<vector<int>> letters(len, vector<int>(27, 0));
+
+        for (int i = 0; i < len; ++i)
+        {
+            int n = words[i].size();
+            for (int j = 0; j < n; ++j)
+            {
+                if (letters[i][words[i][j]-'a'] == 0)
+                {
+                    letters[i][words[i][j]-'a'] = 1;
+                    letters[i][26]++;
+                }
+            }
+        }
+
+        int ct = 0;
+        for (int i = 0; i < len-1; ++i)
+        {
+            for (int j = i+1; j < len; ++j)
+            {
+                if (letters[i][26] == letters[j][26])
+                {
+                    bool flag = true;
+                    for (int k = 0; k < 26; ++k)
+                    {
+                        if (letters[i][k] != letters[j][k])
+                        {
+                            flag = false;
+                            break;
+                        }
+                    }
+                    if (flag)
+                        ++ct;
+                }
+            }
+        }
+
+        return ct;
+    }
diff --git a/src/2515.cpp b/src/2515.cpp
@@ -0,0 +1,25 @@
+int closetTarget(vector<string>& words, string target, int startIndex) {
+        int len = words.size();
+        int i = startIndex;
+        int mindist = len;
+        int n = 0;
+
+        while (n < len)
+        {
+            if (words[i] == target)
+            {
+                int dist1 = abs(i-startIndex);
+                int dist2 = len-dist1;
+                if (dist1 < mindist)
+                    mindist = dist1;
+                if (dist2 < mindist)
+                    mindist = dist2;
+            }
+            ++i;
+            ++n;
+            if (i == len)
+                i = 0;
+        }
+
+        return mindist != len ? mindist : -1;
+    }
diff --git a/src/2520.cpp b/src/2520.cpp
@@ -0,0 +1,13 @@
+int countDigits(int num) {
+        int ct = 0;
+        int val = num;
+        while (val != 0)
+        {
+            int t = val%10;
+            if (t != 0 && num%t == 0)
+                ++ct;
+            val /= 10;
+        }
+
+        return ct;
+    }
diff --git a/src/2529.cpp b/src/2529.cpp
@@ -0,0 +1,6 @@
+int maximumCount(vector<int>& nums) {
+        int pos = nums.end() - upper_bound(nums.begin(), nums.end(), 0);
+        int neg = lower_bound(nums.begin(), nums.end(), 0) - nums.begin();
+
+        return pos > neg ? pos : neg;
+    }
diff --git a/src/2535.cpp b/src/2535.cpp
@@ -0,0 +1,17 @@
+int differenceOfSum(vector<int>& nums) {
+        int elesum = 0, digitsum = 0;
+        int len = nums.size();
+
+        for (int i = 0; i < len; ++i)
+        {
+            elesum += nums[i];
+            int tmp = nums[i];
+            while (tmp != 0)
+            {
+                digitsum += tmp%10;
+                tmp /= 10;
+            }
+        }
+
+        return abs(elesum - digitsum);
+    }
diff --git a/src/2544.cpp b/src/2544.cpp
@@ -0,0 +1,20 @@
+int alternateDigitSum(int n) {
+        int sum = 0;
+        int m = log10(n);
+        const bool arr[10] = {true, false, true, false, true, false, true, false, true, false};
+        bool flag = arr[m];
+
+        while (n != 0)
+        {
+            int tmp = n%10;
+            if (flag)
+                sum += tmp;
+            else
+                sum -= tmp;
+            flag = !flag;
+            
+            n /= 10;
+        }
+
+        return sum;
+    }
diff --git a/src/2549.cpp b/src/2549.cpp
@@ -0,0 +1,6 @@
+int distinctIntegers(int n) {
+        if (n < 3)
+            return 1;
+        else
+            return n-1;
+    }
diff --git a/src/2553.cpp b/src/2553.cpp
@@ -0,0 +1,14 @@
+vector<int> separateDigits(vector<int>& nums) {
+        list<int> tmplist;
+        int len = nums.size();
+        for (int i = len-1; i >= 0; --i)
+        {
+            while (nums[i] != 0)
+            {
+                tmplist.push_front(nums[i]%10);
+                nums[i] /= 10;
+            }
+        }
+
+        return vector<int>(tmplist.begin(), tmplist.end());
+    }
diff --git a/src/2558.cpp b/src/2558.cpp
@@ -0,0 +1,28 @@
+long long pickGifts(vector<int>& gifts, int k) {
+        int len = gifts.size();
+        long long sum = 0;
+        for (int i = 0; i < len; ++i)
+            sum += gifts[i];
+        
+        for (int i = 0; i < k; ++i)
+        {
+            int index = 0;
+            int maxval = 0;
+            for (int j = 0; j < len; ++j)
+            {
+                if (gifts[j] > maxval)
+                {
+                    index = j;
+                    maxval = gifts[j];
+                }
+            }
+
+            int r = sqrt(maxval);
+            if (r == maxval)
+                break;
+            sum -= gifts[index]-r;
+            gifts[index] = r;
+        }
+
+        return sum;
+    }
