5 problems solved.

lintcoder · lintcoder · commit 7938f9dceb76 · 2022-02-07T10:46:03.000+08:00
diff --git a/src/2144.cpp b/src/2144.cpp
@@ -0,0 +1,20 @@
+int minimumCost(vector<int>& cost) {
+        sort(cost.begin(), cost.end());
+        int len = cost.size();
+        int costSum = 0;
+        int i = len-1;
+        while (i >= 0)
+        {
+            costSum += cost[i];
+            --i;
+            if (i < 0)
+                break;
+            costSum += cost[i];
+            --i;
+            if (i < 0)
+                break;
+            --i;
+        }
+        
+        return costSum;
+    }
diff --git a/src/2148.cpp b/src/2148.cpp
@@ -0,0 +1,28 @@
+int countElements(vector<int>& nums) {
+        int minval = 1e6, maxval = -1e6;
+        int minnum = 0, maxnum = 0;
+        int len = nums.size();
+        for (int i = 0; i < len; ++i)
+        {
+            if (nums[i] < minval)
+            {
+                minval = nums[i];
+                minnum = 1;
+            }
+            else if (nums[i] == minval)
+            {
+                ++minnum;
+            }
+            if (nums[i] > maxval)
+            {
+                maxval = nums[i];
+                maxnum = 1;
+            }
+            else if (nums[i] == maxval)
+            {
+                ++maxnum;
+            }
+        }
+
+        return (len-minnum-maxnum) > 0 ? (len-minnum-maxnum) : 0;
+    }
diff --git a/src/2154.cpp b/src/2154.cpp
@@ -0,0 +1,13 @@
+int findFinalValue(vector<int>& nums, int original) {
+        sort(nums.begin(), nums.end());
+        int len = nums.size();
+        int i = 0;
+        while (i < len)
+        {
+            if (nums[i] == original)
+                original *= 2;
+            ++i;
+        }
+        
+        return original;
+    }
diff --git a/src/2160.cpp b/src/2160.cpp
@@ -0,0 +1,23 @@
+int minimumSum(int num) {
+        int arr[4] = {0};
+        int i = 0;
+        while (num > 0)
+        {
+            arr[i++] = num%10;
+            num /= 10;
+        }
+        for (int i = 0; i < 3; ++i)
+        {
+            for (int j = i+1; j < 4; ++j)
+            {
+                if (arr[i] > arr[j])
+                {
+                    int tmp = arr[i];
+                    arr[i] = arr[j];
+                    arr[j] = tmp;
+                }
+            }
+        }
+
+        return arr[0]*10+arr[3] + arr[1]*10+arr[2];
+    }
diff --git a/src/2164.cpp b/src/2164.cpp
@@ -0,0 +1,20 @@
+vector<int> sortEvenOdd(vector<int>& nums) {
+        int len = nums.size();
+        if (len <= 2)
+            return nums;
+        for (int i = 0, j = 1; (i < len-1 || j < len-1); i += 2, j += 2)
+        {
+            for (int m = i+2; m < len; m += 2)
+            {
+                if (nums[i] > nums[m])
+                    swap(nums[i], nums[m]);
+            }
+            for (int n = j+2; n < len; n += 2)
+            {
+                if (nums[j] < nums[n])
+                    swap(nums[j], nums[n]);
+            }
+        }
+        
+        return nums;
+    }
