diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/sort_array.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/sort_array.cpp')
-rw-r--r-- | other/sort_array.cpp | 27 |
1 files changed, 0 insertions, 27 deletions
diff --git a/other/sort_array.cpp b/other/sort_array.cpp deleted file mode 100644 index 655726d..0000000 --- a/other/sort_array.cpp +++ /dev/null @@ -1,27 +0,0 @@ -// 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 -} |