aboutsummaryrefslogtreecommitdiff
path: root/longest_subarr_ones.c
diff options
context:
space:
mode:
Diffstat (limited to 'longest_subarr_ones.c')
-rw-r--r--longest_subarr_ones.c25
1 files changed, 13 insertions, 12 deletions
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 <math.h>
-#include <stdio.h>
+#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
}