aboutsummaryrefslogtreecommitdiff
path: root/other/max_consecutive_ones3.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/max_consecutive_ones3.cpp
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'other/max_consecutive_ones3.cpp')
-rw-r--r--other/max_consecutive_ones3.cpp27
1 files changed, 27 insertions, 0 deletions
diff --git a/other/max_consecutive_ones3.cpp b/other/max_consecutive_ones3.cpp
new file mode 100644
index 0000000..cff044f
--- /dev/null
+++ b/other/max_consecutive_ones3.cpp
@@ -0,0 +1,27 @@
+#include "leetcode.h"
+
+class Solution {
+public:
+ int longestOnes(vector<int> &nums, int k) {
+ int start = 0, end, count = 0, ans = 0;
+ for (int end = 0; end < nums.size(); end++) {
+ if (!nums[end])
+ count++;
+ if (count == k + 1) {
+ while (nums[start])
+ start++;
+ start++;
+ count--;
+ }
+ ans = max(ans, end - start + 1);
+ }
+ return ans;
+ }
+};
+
+int main() {
+ Solution obj;
+ vector<int> nums = {1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0};
+ int k = 2;
+ cout << obj.longestOnes(nums, k);
+}