Given a target A on an infinite number line, i.e. -infinity to +infinity.
You are currently at position 0 and you need to reach the target by moving according to the below rule:
Find the minimum number of moves required to reach the target.
-109 <= A <= 109
First and only argument is an integer A.
Return an integer denoting the minimum moves to reach target.
On the first move we step from 0 to 1. On the second step we step from 1 to 3.
On the first move we step from 0 to 1. On the second move we step from 1 to -1. On the third move we step from -1 to 2.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.