bugfree Icon
interview-course
interview-course
interview-course
interview-course
interview-course
interview-course
interview-course
interview-course

Leetcode Problem 754. Reach a Number

754. Reach a Number

Leetcode Solutions

Minimum Moves to Reach Target on Number Line

  1. Initialize k to 0 and sum to 0.
  2. Increment k and add it to sum until sum is greater than or equal to the absolute value of target.
  3. Calculate delta as sum - abs(target).
  4. If delta is even, return k.
  5. If delta is odd and k+1 is odd, return k+1.
  6. Otherwise, return k+2.
UML Thumbnail

BFS Approach to Reach Target on Number Line

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...