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/shortest_unsorted_subarr.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/shortest_unsorted_subarr.cpp')
-rw-r--r-- | other/shortest_unsorted_subarr.cpp | 30 |
1 files changed, 0 insertions, 30 deletions
diff --git a/other/shortest_unsorted_subarr.cpp b/other/shortest_unsorted_subarr.cpp deleted file mode 100644 index 849f524..0000000 --- a/other/shortest_unsorted_subarr.cpp +++ /dev/null @@ -1,30 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int findUnsortedSubarray(vector<int> &nums) { - int end = -1, start = 0; - int max = nums[0], min = nums[nums.size() - 1]; - for (int i = 1; i < nums.size(); i++) { - if (max > nums[i]) - end = i; - else - max = nums[i]; - } - for (int i = nums.size() - 2; i >= 0; i--) { - if (min < nums[i]) - start = i; - else - min = nums[i]; - } - return end - start + 1; - } -}; - -int main() { - vector<int> nums = {2, 6, 4, 8, 10, 9, 15}; - Solution obj; - for (int i = 0; i < nums.size(); i++) - cout << nums[i] << ' '; - cout << endl << obj.findUnsortedSubarray(nums); -} |