2340 solved.

liuyubobobo · liuyubobobo · commit 17d7c65a18ac · 2022-07-14T14:25:26.000-07:00
diff --git a/2001-2500/2340-Minimum-Adjacent-Swaps-to-Make-a-Valid-Array/cpp-2340/CMakeLists.txt b/2001-2500/2340-Minimum-Adjacent-Swaps-to-Make-a-Valid-Array/cpp-2340/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_2340)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_2340 main.cpp)
diff --git a/2001-2500/2340-Minimum-Adjacent-Swaps-to-Make-a-Valid-Array/cpp-2340/main.cpp b/2001-2500/2340-Minimum-Adjacent-Swaps-to-Make-a-Valid-Array/cpp-2340/main.cpp
@@ -0,0 +1,41 @@
+/// Source : https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array/
+/// Author : liuyubobobo
+/// Time   : 2022-07-14
+
+#include <iostream>
+#include <algorithm>
+#include <numeric>
+#include <climits>
+#include <vector>
+
+using namespace std;
+
+
+/// Ad-Hoc
+/// Time Complexity: O(n)
+/// Space Complexity: O(1)
+class Solution {
+public:
+    int minimumSwaps(vector<int>& nums) {
+
+        int n = nums.size();
+
+        int min_v = nums[0], min_v_index = 0;
+        for(int i = 1; i < n; i ++)
+            if(nums[i] < min_v) min_v = nums[i], min_v_index = i;
+
+        int max_v = nums[0], max_v_index = 0;
+        for(int i = 1; i < n; i ++)
+            if(nums[i] >= max_v) max_v = nums[i], max_v_index = i;
+
+        if(min_v_index == 0 && max_v_index == n - 1) return 0;
+        if(min_v_index < max_v_index) return min_v_index + n - 1 - max_v_index;
+        return min_v_index + n - 2 - max_v_index;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -2187,6 +2187,8 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 2336 | [Smallest Number in Infinite Set](https://leetcode.com/problems/smallest-number-in-infinite-set/) | [无] | [C++](2001-2500/2336-Smallest-Number-in-Infinite-Set/cpp-2336/) | | |
 | 2337 | [Move Pieces to Obtain a String](https://leetcode.com/problems/move-pieces-to-obtain-a-string/) | [无] | [C++](2001-2500/2337-Move-Pieces-to-Obtain-a-String/cpp-2337/) | | |
 | 2338 | [Count the Number of Ideal Arrays](https://leetcode.com/problems/count-the-number-of-ideal-arrays/) | [无] | [C++](2001-2500/2338-Count-the-Number-of-Ideal-Arrays/cpp-2338/) | | |
+| 2339 | Database Problem: [Link](https://github.com/liuyubobobo/Play-Leetcode-Database/) | - | - | - | - |
+| 2340 | [Minimum Adjacent Swaps to Make a Valid Array](https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array/) | [无] | [C++](2001-2500/2340-Minimum-Adjacent-Swaps-to-Make-a-Valid-Array/cpp-2340/) | | |
 | | | | | | |
 
 ## 力扣中文站比赛
