https://leetcode-cn.com/problems/reach-a-number/description/
思路:先把target转为正数,因为正负都是对称的。
先累加,若sum==target,直接返回;若sum>target,先计算sum与target的差距bias,若bias为偶数,也直接返回。这里用到一个很巧妙的思路:若bias为偶,则将第bias/2
步反向走即可,这样与sum的偏差恰好为bias。
class Solution:
def reachNumber(self, target):
"""
:type target: int
:rtype: int
"""
step, sum = 0, 0
target = abs(target)
for i in range(1, 10**9): #循环次数不确定,就先来个10^9次
sum += i
if sum == target:
step = i
break
elif sum > target:
bias = sum - target
if bias % 2 == 0:
step = i
break
return step