[LeetCode] Frog Jump

题干：
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.
Given a list of stones’ positions (in units) in sorted ascending order, determine if the frog is able to cross the river by landing on the last stone. Initially, the frog is on the first stone and assume the first jump must be 1 unit.
If the frog’s last jump was k units, then its next jump must be either k - 1, k, or k + 1 units. Note that the frog can only jump in the forward direction.
Note:
The number of stones is ≥ 2 and is < 1,100.
Each stone’s position will be a non-negative integer < 231.
The first stone’s position is always 0.
Example 1:
[0,1,3,5,6,8,12,17]
There are a total of 8 stones.
The first stone at the 0th unit, second stone at the 1st unit,
third stone at the 3rd unit, and so on…
The last stone at the 17th unit.
Return true. The frog can jump to the last stone by jumping
1 unit to the 2nd stone, then 2 units to the 3rd stone, then
2 units to the 4th stone, then 3 units to the 6th stone,
4 units to the 7th stone, and 5 units to the 8th stone.
Example 2:
[0,1,2,3,4,8,9,11]
Return false. There is no way to jump to the last stone as
the gap between the 5th and 6th stone is too large.

题目解析：
这道题目给了我们一个数组，其中里面的数字代表一条河里第num[i]个unit有石头，要从第1个位置开始跳到最后一个位置的石头上，第一次只能跳1个unit，而后每跳一次，只能跳k，k-1或k+1个unit，其中k为上一次跳过的unit。因此，我们要判断能否跳到第n个位置，只需要判断能否第n - k，n-k+1和n-k-1个位置。因此，要解决这个问题，就要清楚在每一个位置k的取值的可能，以及能否跳到这个位置上，因此对于每一个位置，我们都维护一个vector，记录跳到这个位置可能存在的k，然后进行从第1个位置开始逐个进行判断即可，AC的代码如下：

class Solution {
public:
    bool canCross(vector<int>& stones) {
        int size = stones.size();
        bool result[size];
        result[0] = true;
        vector<int> steps[size];
        if (size == 2 && stones[1] == 1) {
            return true;
        }
        steps[1].push_back(1);
        for (int i = 2; i < size; i ++) {
            result[i] = false;
            for (int j = 1; j < i; j ++) {
                int step = stones[i] - stones[j];
                vector<int>::iterator ret, ret1, ret2;
                ret = std::find(steps[j].begin(), steps[j].end(), step);
                ret1 = std::find(steps[j].begin(), steps[j].end(), step - 1);
                ret2 = std::find(steps[j].begin(), steps[j].end(), step + 1);
                if (ret != steps[j].end()) {
                    steps[i].push_back(step);
                    result[i] = true;
                }
                if (ret1 != steps[j].end()) {
                    steps[i].push_back(step);
                    result[i] = true;
                }
                if (ret2 != steps[j].end()) {
                    steps[i].push_back(step);
                    result[i] = true;
                }
            }
        }
        return result[size - 1];
    }
};