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/wiggle_subsequence.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/wiggle_subsequence.cpp')
-rw-r--r-- | other/wiggle_subsequence.cpp | 23 |
1 files changed, 0 insertions, 23 deletions
diff --git a/other/wiggle_subsequence.cpp b/other/wiggle_subsequence.cpp deleted file mode 100644 index 22376d4..0000000 --- a/other/wiggle_subsequence.cpp +++ /dev/null @@ -1,23 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int wiggleMaxLength(vector<int> &nums) { - int ans = 1, i = 1; - while (i < nums.size() && nums[i] == nums[i - 1]) - i++; - if (i == nums.size()) - return 1; - bool upper = nums[i - 1] > nums[i]; - for (; i < nums.size(); i++) - if ((upper && nums[i] < nums[i - 1]) || !upper && nums[i] > nums[i - 1]) - upper = !upper, ans++; - return ans; - } -}; - -int main() { - Solution obj; - vector<int> nums = {1, 17, 5, 10, 13, 15, 10, 5, 16, 8}; - cout << obj.wiggleMaxLength(nums); -} |