https://leetcode.com/problems/reach-a-number/description/
class Solution {
public:
int reachNumber(int target) {
target = abs(target);
int step = 0, sum = 0;
while (sum<target || (sum-target)%2!=0) {
step+=1;
sum += step;
}
return step;
}
};