JumpSolution

public static void solution(int n, int[] nums) {
        int highestJump = 0;
        int[] jumpPerNum = new int[n];

        for(int i = 0; i < n; i++) {
            int currNum = i;
            int currJump = 0;

            int prevJumpNum = i;
            while (currNum < n - 1) {
                if(nums[currNum] < nums[currNum + 1] && nums[prevJumpNum] < nums[currNum + 1]) {
                    currJump++;
                    prevJumpNum = currNum + 1;
                }

                currNum++;
            }

            if(currJump > highestJump) {
                highestJump = currJump;
            }
            jumpPerNum[i] = currJump;
        }

        System.out.println(highestJump);
        System.out.println(Arrays.toString(jumpPerNum));
    }