aboutsummaryrefslogtreecommitdiff
path: root/other/sort_array.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /other/sort_array.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/sort_array.cpp')
-rw-r--r--other/sort_array.cpp27
1 files changed, 27 insertions, 0 deletions
diff --git a/other/sort_array.cpp b/other/sort_array.cpp
new file mode 100644
index 0000000..655726d
--- /dev/null
+++ b/other/sort_array.cpp
@@ -0,0 +1,27 @@
+// 912. Sort an Array
+#include "leetcode.h"
+#include <vector>
+
+class Solution {
+public:
+ vector<int> sortArray(vector<int> &nums) {
+ int end_idx, curr_idx, n = nums.size();
+ if (n <= 1)
+ return {};
+ for (int i = n - 1; i; i--)
+ for (int j = 0; j < i; j++)
+ if (nums[j] > nums[j + 1])
+ swap(nums[j], nums[j + 1]);
+ return nums;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> n1 = {5, 2, 3, 1}, n2 = {5, 1, 1, 2, 0, 0};
+ for (auto i : obj.sortArray(n1))
+ cout << i << ' '; // expect: 1,2,3,5
+ cout << endl;
+ for (auto i : obj.sortArray(n2))
+ cout << i << ' '; // expect: 0,0,1,1,2,5
+}