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/132_pattern.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/132_pattern.cpp')
-rw-r--r-- | other/132_pattern.cpp | 32 |
1 files changed, 0 insertions, 32 deletions
diff --git a/other/132_pattern.cpp b/other/132_pattern.cpp deleted file mode 100644 index a9f0c43..0000000 --- a/other/132_pattern.cpp +++ /dev/null @@ -1,32 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool find132pattern(vector<int> &nums) { - int n = nums.size(), minI[n]; - stack<int> s; - minI[0] = nums[0]; - for (int i = 1; i < nums.size(); i++) - minI[i] = min(minI[i - 1], nums[i]); - for (int i = nums.size() - 1; i >= 0; i--) { - while (!s.empty() && s.top() <= minI[i]) - s.pop(); - if (!s.empty() && s.top() < nums[i]) - return true; - s.push(nums[i]); - } - return false; - } -}; - -int main() { - vector<int> nums = {1, 3, 2, 4}; - Solution obj; - for (int i = 0; i < nums.size(); i++) - cout << nums[i] << ' '; - cout << endl << "searching for '132'...\n"; - if (obj.find132pattern(nums)) - cout << "found"; - else - cout << "not found"; -} |