LeetCode刷题-JumpGameII

Jump Game II

Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Your goal is to reach the last index in the minimum number of jumps.
Example:
Input: [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2.
Jump 1 step from index 0 to 1, then 3 steps to the last index.
Note:
You can assume that you can always reach the last index.

输入为一个非负整数数组，初始位置为数组的第一个数，数组中的每个值表示能从该位置向前进的最大距离。计算到最后一位需要的最小布数。假设输入的数组都能根据规则从第一位置跳到最后一位。
例如：[2,3,1,1,4]
初使位置为0，nums[0] 为 2，在0的位置上最多可以向前跳2个位置。最后的结果为 0->1->4，最小步数为2。

实现的时候每一步都寻找能到的最远位置。

public static IList<IList<int>> Permute(int[] nums)
{
    IList<IList<int>> result = new List<IList<int>>();
    if (nums.Length == 0) {
        return result;
    }
    if (nums.Length == 1)
    {
        result.Add(new List<int>() { nums[0] });
    }
    else if (nums.Length == 2)
    {
        result.Add(new List<int>() { nums[0], nums[1] });
        result.Add(new List<int>() { nums[1], nums[0] });
    }
    else 
    {
        List<int> union_num = new List<int>();
        for (int i = 0; i < nums.Length; i++)
        {
            if (!union_num.Contains(nums[i])) 
            {
                union_num.Add(nums[i]);
                List<int> _tmp = nums.ToList();
                _tmp.RemoveAt(i);
                IList<IList<int>> _result = Permute(_tmp.ToArray());
                for (int j = 0; j < _result.Count; j++) 
                {
                    result.Add((new List<int>() { nums[i] }).Concat(_result[j]).ToList());
                }
            }
        }
    }
    
    return result;
}