From bcb15f738e3a11bdf7389b21e57589855463aba8 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Sat, 23 Aug 2025 19:48:07 -0600 Subject: 1493. longest subarray of 1's after deleting one element --- longest_subarr_ones.c | 25 +++++++++++++------------ longest_subarr_ones.py | 32 ++++++++++++++++++++++++++++++++ 2 files changed, 45 insertions(+), 12 deletions(-) create mode 100644 longest_subarr_ones.py diff --git a/longest_subarr_ones.c b/longest_subarr_ones.c index 049ce33..dc9aa84 100644 --- a/longest_subarr_ones.c +++ b/longest_subarr_ones.c @@ -1,6 +1,5 @@ // 1493. Longest Subarray of 1's After Deleting One Element -#include -#include +#include "leetcode.h" /* * given a binary array 'nums', you should delete one element from it. return @@ -8,24 +7,26 @@ * resulting array. return 0 if there is no such subarray. */ -int longestSubarray(int *nums, int nums_size) { - int n = nums_size, zero_cnt = 0, ans = 0, left = 0; - for (int right = 0; right < n; right++) { +int longestSubarray(int *nums, int numsSize) { + int left = 0, zeros = 0, ans = 0; + for (int right = 0; right < numsSize; right++) { if (!nums[right]) - zero_cnt++; - while (zero_cnt > 1) { + zeros++; + while (zeros > 1) { if (!nums[left]) - zero_cnt--; + zeros--; left++; } - ans = fmax(ans, right - left); + int length = right - left; + if (length > ans) + ans = length; } return ans; } int main() { int n1[] = {1, 1, 0, 1}, n2[] = {0, 1, 1, 1, 0, 1, 1, 0, 1}, n3[] = {1, 1, 1}; - printf("%d\n", longestSubarray(n1, 4)); // expect: 3 - printf("%d\n", longestSubarray(n2, 9)); // expect: 5 - printf("%d\n", longestSubarray(n3, 3)); // expect: 2 + printf("%d\n", longestSubarray(n1, ARRAY_SIZE(n1))); // expect: 3 + printf("%d\n", longestSubarray(n2, ARRAY_SIZE(n2))); // expect: 5 + printf("%d\n", longestSubarray(n3, ARRAY_SIZE(n3))); // expect: 2 } diff --git a/longest_subarr_ones.py b/longest_subarr_ones.py new file mode 100644 index 0000000..a4b3623 --- /dev/null +++ b/longest_subarr_ones.py @@ -0,0 +1,32 @@ +# 1493. Longest Subarray of 1's After Deleting One Element + +""" +given a binary array 'nums', you should delete one element from it. return +the size of the longest non-empty subarray containing only 1's in the +resulting array. return 0 if there is no such subarray. +""" + + +class Solution(object): + def longestSubarray(self, nums): + """ + :type nums: List[int] + :rtype: int + """ + left, zeros, ans = 0, 0, 0 + for right in range(len(nums)): + if nums[right] == 0: + zeros += 1 + while zeros > 1: + if nums[left] == 0: + zeros -= 1 + left += 1 + ans = max(ans, right - left) + return ans + + +if __name__ == "__main__": + obj = Solution() + print(obj.longestSubarray(nums=[1, 1, 0, 1])) + print(obj.longestSubarray(nums=[0, 1, 1, 1, 0, 1, 1, 0, 1])) + print(obj.longestSubarray(nums=[1, 1, 1])) -- cgit v1.2.3