Array degree algo

Degree.java

public static String codeHere(String inputData) {
        // Use this function to write your solution;

        String[] arrayInfo = inputData.split("\n");
        int size = Integer.parseInt(arrayInfo[0]);
        int[] lenghsArray = new int[size];
        String[] stringArray = arrayInfo[1].split(" ");
        List<Integer> subArray = new ArrayList<>();


        for (int i = 0; i < size; i++) {
            int currentNumber = Integer.parseInt(stringArray[i]);
            int nextNumber = -1;
            if (i < size - 1)
                nextNumber = Integer.parseInt(stringArray[i + 1]);

            if (currentNumber == nextNumber) {
                subArray.add(currentNumber);
            } else {
                if (!subArray.isEmpty() || currentNumber == -1)
                    subArray.add(currentNumber);
                lenghsArray[i] = subArray.size();
                subArray.clear();
            }

        }

        int minLength = Integer.MAX_VALUE;
        for (int i = 0; i < size; i++) {
            if (lenghsArray[i] < minLength && lenghsArray[i] > 0)
                minLength = lenghsArray[i];
        }


        return String.valueOf(minLength);
    }