Advertisement
CoineTre

JF-ExcArrays07.Max Sequence of Equal Elements

Jan 21st, 2021
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.12 KB | None | 0 0
  1. /*
  2. Write a program that finds the longest sequence of equal elements in an array of integers. If several longest sequences exist, print the leftmost one.
  3. 2 1 1 2 3 3 2 2 2 1   ///   2 2 2
  4. */
  5. import java.util.Arrays;
  6. import java.util.Scanner;
  7.  
  8. public class TestXXX {
  9.     public static void main(String[] args) {
  10.         Scanner scanner = new Scanner(System.in);
  11.         int[] numbers = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
  12.         int sequenceN = 1;
  13.         int longSequence = 0;
  14.         int indexNumber = 0;
  15.         for (int i = 0; i < numbers.length-1; i++) {
  16.             int currentN = numbers[i];
  17.             int nextN = numbers[i+1];
  18.              if (currentN == nextN){
  19.                     sequenceN++;
  20.                     if (sequenceN > longSequence){
  21.                         longSequence = sequenceN;
  22.                         indexNumber = currentN;
  23.                     }
  24.              }else{
  25.                  sequenceN = 1;
  26.              }
  27.         }
  28.         for (int i = 0; i < longSequence; i++) {
  29.             System.out.print(indexNumber + " ");
  30.         }
  31.     }
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement