Wilbur and Array

• Status: Completed

Solved	Solution	Time
	Greedy algorithm	156 ms

Solution or Solution discussion

The general solution to find the number of step to make the array A equal to input array was reduced to a local problem to find and sum the difference from element in position steps += inputs[i] - inputs[i-1]. This solution use the greedy algorithm