6 problems solved.

lintcoder · lintcoder · commit 6a8b705c3f2a · 2023-04-04T21:41:49.000+08:00
diff --git a/src/2540.cpp b/src/2540.cpp
@@ -0,0 +1,27 @@
+int getCommon(vector<int>& nums1, vector<int>& nums2) {
+        int len1 = nums1.size(), len2 = nums2.size();
+        int i = 0, j = 0;
+        while (i < len1 && j < len2)
+        {
+            if (nums1[i] == nums2[j])
+                return nums1[i];
+            else if (nums1[i] < nums2[j])
+                ++i;
+            else
+                ++j;
+        }
+
+        while (i < len1 && nums1[i] < nums2[len2-1])
+            ++i;
+        while (j < len2 && nums2[j] < nums1[len1-1])
+            ++j;
+        
+        if (i == len1 || nums1[i] > nums2[len2-1])
+            return -1;
+        else if (j == len2 || nums2[j] > nums1[len1-1])
+            return -1;
+        else if (i < len1)
+            return nums2[len2-1];
+        else
+            return nums1[len1-1];
+    }
diff --git a/src/2562.cpp b/src/2562.cpp
@@ -0,0 +1,18 @@
+long long findTheArrayConcVal(vector<int>& nums) {
+        int len = nums.size();
+        int lim = len/2;
+        long long concatsum = 0;
+
+        const long long coeff[] = {10, 100, 1000, 10000, 100000};
+
+        for (int i = 0; i < lim; ++i)
+        {
+            int n = log10(nums[len-1-i]);
+            concatsum += nums[i]*coeff[n] + nums[len-1-i];
+        }
+
+        if (len%2 != 0)
+            concatsum += nums[lim];
+
+        return concatsum;
+    }
diff --git a/src/2570.cpp b/src/2570.cpp
@@ -0,0 +1,39 @@
+vector<vector<int>> mergeArrays(vector<vector<int>>& nums1, vector<vector<int>>& nums2) {
+        int len1 = nums1.size();
+        int len2 = nums2.size();
+        int i = 0, j = 0;
+
+        vector<vector<int>> res;
+        while (i < len1 && j < len2)
+        {
+            if (nums1[i][0] == nums2[j][0])
+            {
+                res.push_back({nums1[i][0], nums1[i][1]+nums2[j][1]});
+                ++i;
+                ++j;
+            }
+            else if (nums1[i][0] < nums2[j][0])
+            {
+                res.push_back(nums1[i]);
+                ++i;
+            }
+            else
+            {
+                res.push_back(nums2[j]);
+                ++j;
+            }
+        }
+
+        while (i < len1)
+        {
+            res.push_back(nums1[i]);
+            ++i;
+        }
+        while (j < len2)
+        {
+            res.push_back(nums2[j]);
+            ++j;
+        }
+
+        return res;
+    }
diff --git a/src/2574.cpp b/src/2574.cpp
@@ -0,0 +1,18 @@
+vector<int> leftRigthDifference(vector<int>& nums) {
+        int len = nums.size();
+        int sum = 0;
+
+        vector<int> leftsum(len, 0);
+        vector<int> res(len, 0);
+        for (int i = 0; i < len; ++i)
+        {
+            leftsum[i] = sum;
+            sum += nums[i];
+        }
+        for (int i = 0; i < len; ++i)
+        {
+            res[i] = abs(leftsum[i]-(sum-leftsum[i]-nums[i]));
+        }
+
+        return res;
+    }
diff --git a/src/2586.cpp b/src/2586.cpp
@@ -0,0 +1,13 @@
+int vowelStrings(vector<string>& words, int left, int right) {
+        int ct = 0;
+        for (int i = left; i <= right; ++i)
+        {
+            char s = words[i][0], e = *words[i].rbegin();
+            if ((s == 'a' || s == 'e' || s == 'i' ||
+                s == 'o' || s == 'u') && (e == 'a' || e == 'e' ||
+                e == 'i' || e == 'o' || e == 'u'))
+                ++ct;
+        }
+
+        return ct;
+    }
diff --git a/src/2595.cpp b/src/2595.cpp
@@ -0,0 +1,13 @@
+vector<int> evenOddBit(int n) {
+        vector<int> res(2, 0);
+        int i = 0;
+        
+        while (n != 0)
+        {
+            res[i] += n & 0x1;
+            i = 1-i;
+            n >>= 1;
+        }
+
+        return res;
+    }
