package DominoAlgorytm;

public class Domino {
    public String LongestSeries(String Series){
        int highestNumber = 0;
        String[] dividedSeries = Series.split(",");
        String[][] dividedSeriesMore = new String[dividedSeries.length][2];

        for(int i = 0; i < dividedSeries.length; i++){
            dividedSeriesMore[i][0] = dividedSeries[i].substring(0,1);
            dividedSeriesMore[i][1] = dividedSeries[i].substring(2,3);

            int actualValue = Integer.valueOf(dividedSeriesMore[i][0]);
            if(actualValue > highestNumber) highestNumber = actualValue;

            System.out.println("Pos.:" + i +
                    "\ti0:" +  dividedSeriesMore[i][0] +
                    "\ti1:" +  dividedSeriesMore[i][1]
            );
        }
        System.out.println("Highest number: " + highestNumber);


        String newString = "";
        boolean change;
        do {
            change = false;

            for(int i = 0; i < dividedSeriesMore.length; i++){
                if(dividedSeriesMore[i][0].contains(String.valueOf(highestNumber))){
                    newString = newString + dividedSeriesMore[i][0] + "-" + dividedSeriesMore[i][1] + ",";
                    highestNumber = Integer.valueOf(dividedSeriesMore[i][1]);

                    dividedSeriesMore[i][0] = "-1";
                    dividedSeriesMore[i][1] = "-1";
                    change = true;
                }
            }
        } while(change);

        return newString.substring(0, newString.length() - 1);
    }
}