aboutsummaryrefslogtreecommitdiff
path: root/longest_subarr_ones.c
blob: dc9aa843d9fd2e36a51af6763eec411c4341cf8f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
// 1493. Longest Subarray of 1's After Deleting One Element
#include "leetcode.h"

/*
 * 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.
 */

int longestSubarray(int *nums, int numsSize) {
  int left = 0, zeros = 0, ans = 0;
  for (int right = 0; right < numsSize; right++) {
    if (!nums[right])
      zeros++;
    while (zeros > 1) {
      if (!nums[left])
        zeros--;
      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, 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
}