贪心法-Jump Game II

给定一个数组，每个数组元素为跳转的最大值，求走完这个数组的最小步骤

public static int Jump(int[] nums)
        {
            int step = 0;
            int left = 0;
            int right = 0;
            if (nums.Length == 1) return 0;
            while (left <= right)
            {
                ++step;
                int old_right =right;
                for(int i = left; i <= old_right; ++i)
                {
                    int new_right = i + nums[i];

                    if (new_right >= nums.Length - 1) return step;

                    if (new_right > right) right = new_right;


                }
                left = old_right + 1;
            }
            return 0;
        }

 public static int jump(int[] nums)
        {
            int result = 0;
            int last = 0;
            int cur = 0;
            for(int i = 0; i < nums.Length; ++i)
            {
                if (i > last)
                {
                    last = cur;
                    ++result;
                }
                cur = Math.Max(cur, i + nums[i]);
            }

            return result;
        }