Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- 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.
- 2 1 1 2 3 3 2 2 2 1 /// 2 2 2
- */
- import java.util.Arrays;
- import java.util.Scanner;
- public class TestXXX {
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- int[] numbers = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
- int sequenceN = 1;
- int longSequence = 0;
- int indexNumber = 0;
- for (int i = 0; i < numbers.length-1; i++) {
- int currentN = numbers[i];
- int nextN = numbers[i+1];
- if (currentN == nextN){
- sequenceN++;
- if (sequenceN > longSequence){
- longSequence = sequenceN;
- indexNumber = currentN;
- }
- }else{
- sequenceN = 1;
- }
- }
- for (int i = 0; i < longSequence; i++) {
- System.out.print(indexNumber + " ");
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement