403. 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 < 2³¹.
• 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.

	典型的动态规划问题，利用一个数组存储到达当前状态的不同路径的上一步所越过的石头数目的所有可能性，从前往后遍历，当当前石头的可能性数组大小为零的话，则说明当前石头不可能到达，那么就可以直接忽略当前石头，而如果不为零，那就遍历可能性，对每种可能性所能达到的下一块石头的数组添加可能性，因为青蛙只能向前跳，所以从前往后遍历则能得到所有的可能性。复杂度为O(n^2)。

代码如下：

class Solution {
public:
    map<int,set<int>> step;   
    bool canCross(vector<int>& stones) {
        if(stones[1]-stones[0]>1)
        return 0;
        else
        step[stones[1]].insert(stones[1]-stones[0]);
        for(int i=1;i<stones.size();i++)
        {
            if(step[stones[i]].size()==0)
            continue;            
            for(int j:step[stones[i]])
            {
                if(j!=1)
                step[stones[i]+j-1].insert(j-1);
                step[stones[i]+j].insert(j); 
                step[stones[i]+j+1].insert(j+1);               
            }
        }       
        if(step[stones[stones.size()-1]].size()!=0)
        return 1;
        else
        return 0;
    }
};