In this program, we are going to share a Java program to find length of the longest bitonic subarray. If you are a Java beginner and want to start learning the Java programming, then keep your close attention in this tutorial as I am going to share how to write a Java program to find length of the longest bitonic subarray.
Copy the below Java program and execute it with the help of Javac compiler. At the end of this program, We have shared the output of this program.
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 33 34 35 36 37 | import java.io.*; import java.util.*; class Bitonic { static int bitonic(int arr[], int n) { int[] inc = new int[n]; int[] dec = new int[n]; int max; inc[0] = 1; dec[n-1] = 1; for (int i = 1; i < n; i++) inc[i] = (arr[i] >= arr[i-1])? inc[i-1] + 1: 1; for (int i = n-2; i >= 0; i--) dec[i] = (arr[i] >= arr[i+1])? dec[i+1] + 1: 1; max = inc[0] + dec[0] - 1; for (int i = 1; i < n; i++) if (inc[i] + dec[i] - 1 > max) max = inc[i] + dec[i] - 1; return max; } public static void main (String[] args) { int arr[] = {12, 4, 78, 90, 45, 23}; int n = arr.length; System.out.println("Length of max length Bitnoic Subarray is " + bitonic(arr, n)); } } |
If you like FreeWebMentor and you would like to contribute, you can write an article and mail your article to [email protected] Your article will appear on the FreeWebMentor main page and help other developers.
