[Algorithm] arrayChange

Solution

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.

Input/Output

• [input] array.integer inputArray

  Guaranteed constraints:
  3 ≤ inputArray.length ≤ 105,
  -105 ≤ inputArray[i] ≤ 105.

• [output] integer

  The minimal number of moves needed to obtain a strictly increasing sequence from inputArray.
  It's guaranteed that for the given test cases the answer always fits signed 32-bit integer type.

Solution

def arrayChange(inputArray):
count = 0
for i in range(len(inputArray) - 1):
if inputArray[i+1] <= inputArray[i]:
count += inputArray[i] - inputArray[i+1] + 1
inputArray[i+1] = inputArray[i] + 1

return count

*count : sequence하게 올라가야 하는 횟수를 저장한 변수