ArrayChange.java

/*

You are given an array of integers. On each move you are allowed to increase exactly one of its element by one. Find the minimal number of moves required to obtain a strictly increasing sequence from the input.

Example

For inputArray = [1, 1, 1], the output should be
arrayChange(inputArray) = 3.

*/
int arrayChange(int[] inputArray) {
    int res=0;
    for(int i=0;i<inputArray.length-1;i++){
        if(inputArray[i]>=inputArray[i+1]){
            int temp=inputArray[i]-inputArray[i+1]+1;
            res=res+temp;
            inputArray[i+1]=inputArray[i+1]+temp;
        }
    }
    return res;
}