Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 754 with 46 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 754 # by problem number
lcpy gen -s reach_a_number # by problem name
0 on an infinite number line. There is a destination at position target.
You can make some number of moves numMoves so that:
i^th move (starting from i == 1 to i == numMoves), you take i steps in the chosen direction.target, return the minimum number of moves required (i.e., the minimum numMoves) to reach the destination.
Input: target = 2
Output: 3
Explanation:
On the 1st move, we step from 0 to 1 (1 step).
On the 2nd move, we step from 1 to -1 (2 steps).
On the 3rd move, we step from -1 to 2 (3 steps).
Input: target = 3
Output: 2
Explanation:
On the 1st move, we step from 0 to 1 (1 step).
On the 2nd move, we step from 1 to 3 (2 steps).
-10^9 <= target <= 10^9target != 0class Solution:
# Time: O(sqrt(target)) - the loop runs about sqrt(2 * |target|) times
# Space: O(1)
def reach_number(self, target: int) -> int:
target = abs(target)
moves = 0
total = 0
while total < target or (total - target) % 2:
moves += 1
total += moves
return moves
| Time | Space | ||
|---|---|---|---|
| O(sqrt(target)) - the loop runs about sqrt(2 * | target | ) times | O(1) |