Length of the longest alternating subarray
Given an array of N including positive and negative numbers only. The task is to find the length of the longest alternating (means negative-positive-negative or positive-negative-positive) subarray present in the array.
Examples:
Input: a[] = {-5, -1, -1, 2, -2, -3}
Output: 3
The subarray {-1, 2, -2}
Input: a[] = {1, -5, 1, -5}
Output: 4
Approach: The following steps are followed to solve the problem:
- Initially initialize cnt as 1.
- Iterate among the array elements, check if it has an alternate sign.
- Increase the cnt by 1 if it has a alternate sign.
- If it does not has an alternate sign, then re-initialize cnt by 1.
Below is the implementation of the above approach:
C++
// C++ program to find the longest alternating // subarray in an array of N number #include <bits/stdc++.h> using namespace std; // Function to find the longest subarray int longestAlternatingSubarray(int a[], int n) { // Length of longest alternating int longest = 1; int cnt = 1; // Iterate in the array for (int i = 1; i < n; i++) { // Check for alternate if (a[i] * a[i - 1] < 0) { cnt++; longest = max(longest, cnt); } else cnt = 1; } return longest; } /* Driver program to test above functions*/int main() { int a[] = { -5, -1, -1, 2, -2, -3 }; int n = sizeof(a) / sizeof(a[0]); // Function to find the longest subarray cout << longestAlternatingSubarray(a, n); return 0; } |
chevron_right
filter_none
Java
// Java program to find the longest alternating // subarray in an array of N number class GFG { // Function to find the longest subarray static int longestAlternatingSubarray(int a[], int n) { // Length of longest alternating int longest = 1; int cnt = 1; // Iterate in the array for (int i = 1; i < n; i++) { // Check for alternate if (a[i] * a[i - 1] < 0) { cnt++; longest = Math.max(longest, cnt); } else cnt = 1; } return longest; } /* Driver program to test above functions*/ public static void main (String[] args) { int a[] = { -5, -1, -1, 2, -2, -3 }; int n = a.length ; // Function to find the longest subarray System.out.println(longestAlternatingSubarray(a, n)); } } // This code is contributed by Ryuga |
chevron_right
filter_none
Python 3
# Python3 program to find the longest alternating # subarray in an array of N number # Function to find the longest subarray def longestAlternatingSubarray(a, n): # Length of longest alternating longest = 1 cnt = 1 # Iterate in the array i = 1 while i < n: # Check for alternate if (a[i] * a[i - 1] < 0): cnt = cnt + 1 longest = max(longest, cnt) else: cnt = 1 i = i + 1 return longest # Driver Code a = [ -5, -1, -1, 2, -2, -3 ] n = len(a) # Function to find the longest subarray print(longestAlternatingSubarray(a, n)) # This code is contributed # by shashank_sharma |
chevron_right
filter_none
C#
// C# program to find the longest alternating // subarray in an array of N number using System; class GFG { // Function to find the longest subarray static int longestAlternatingSubarray(int []a, int n) { // Length of longest alternating int longest = 1; int cnt = 1; // Iterate in the array for (int i = 1; i < n; i++) { // Check for alternate if (a[i] * a[i - 1] < 0) { cnt++; longest = Math.Max(longest, cnt); } else cnt = 1; } return longest; } // Driver Code public static void Main() { int []a = { -5, -1, -1, 2, -2, -3 }; int n = a.Length; // Function to find the longest subarray Console.Write(longestAlternatingSubarray(a, n)); } } // This code is contributed // by Akanksha Rai |
chevron_right
filter_none
PHP
<?php // PHP program to find the longest alternating // subarray in an array of N number // Function to find the longest subarray function longestAlternatingSubarray($a, $n) { // Length of longest alternating $longest = 1; $cnt = 1; // Iterate in the array for ($i = 1; $i < $n; $i++) { // Check for alternate if ($a[$i] * $a[$i - 1] < 0) { $cnt++; $longest = max($longest, $cnt); } else $cnt = 1; } return $longest; } // Driver Code $a = array(-5, -1, -1, 2, -2, -3 ); $n = sizeof($a); // Function to find the longest subarray echo longestAlternatingSubarray($a, $n); // This code is contributed by akt_mit ?> |
chevron_right
filter_none
Output:
3
Recommended Posts:
- Longest alternating (positive and negative) subarray starting at every index
- Length of the longest Subarray with only Even Elements
- Length of longest increasing circular subarray
- Length of longest subarray in which elements greater than K are more than elements not greater than K
- Maximum length of subarray such that sum of the subarray is even
- Longest alternating sub-array starting from every index in a Binary Array
- Longest subarray with sum divisible by k
- Longest increasing subarray
- Longest subarray having maximum sum
- Longest subarray such that the difference of max and min is at-most one
- Longest Subarray having sum of elements atmost 'k'
- Longest Subarray having strictly positive XOR
- Longest subarray not having more than K distinct elements
- Longest subarray with elements divisible by k
- Longest subarray in which all elements are greater than K
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
- Nth Fibonacci number using Pell's equation
- Implementation of Non-Preemptive Shortest Job First using Priority Queue
- Comparing X^Y and Y^X for very large values of X and Y
- Count the values greater than X in the modified array
- Sum of absolute differences of pairs from the given array that satisfy the given condition
- Subsequence X of length K such that gcd(X[0], X[1]) + (X[2], X[3]) + ... is maximized
- Find prime numbers in the first half and second half of an array
- Smallest element greater than X not present in the array
- Pair with largest sum which is less than K in the array
- Find sum of a[i]%a[j] for all valid pairs