GeetCode Hub

  1. Home
  2. GeetCode
  3. GeetCode Hub

You are standing at position 0 on an infinite number line. There is a goal at position target.

On each move, you can either go left or right. During the nth move (starting from n == 1), you take n steps.

Return the minimum number of steps required to reach the destination.

 

Example 1:

Input: target = 2
Output: 3
Explanation:
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.

Example 2:

Input: target = 3
Output: 2
Explanation:
On the first move, we step from 0 to 1.
On the second step, we step from 1 to 3.

 

Constraints:

  • -109 <= target <= 109
  • target != 0

class Solution { public int reachNumber(int target) { } }