Authors:
Stuart Reges, Marty Stepp
Chapter:
Arrays
Exercise:
Exercises
Question:13 | ISBN:9780136091813 | Edition: 2
Question
Write a method called longestSortedSequence that accepts an array of integers as a parameter and returns the length of the longest sorted (nondecreasing) sequence of integers in the array. For example, in the array {3, 8, 10, 1, 9, 14, -3, 0, 14, 207, 56, 98, 12}, the longest sorted sequence in the array has four values in it (the sequence -3, 0, 14, 207), so your method would return 4 if passed this array. Sorted means nondecreasing, so a sequence could contain
duplicates. Your method should return 0 if passed an empty array.
Answer
Implementation of longestSortedSequence method:
public static int longestSortedSequence(int[] a)
{
if(a.length == 0)
return 0;
int longest = 1;
int count = 1;
for(int i = 1; i < a.length; i++)
{
if(a[i] >= a[i - 1])
count++;
else
count = 1;
if(count > longest)
longest = count;
}
return longest;
}