[LeetCode] 45. Jump Game II

auto size = nums.size();

if (size == 1)
	return 0;

int ans = 1, end = nums[0], far = nums[0];

for (int i = 0; i < nums.size() - 1; i++)
{
	far = max(far, nums[i] + i);

	if (i == end)
	{
		ans++;
		end = far;

		if (end >= size - 1)
			break;
	}
}
return ans;