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.

总结下问题：青蛙跳过河，最开始的position是0，并且在0 position上，第一次跳跃的units是1，往后的跳跃units，只能是上一个position对应的units（比如为k）的 k+1,k-1,k； 给定一position序列，求青蛙能否跳到对岸的position？

思路，选用 unordered_map<int,set<int>> 数据结构,key 是position，value是该position对应的所有可跳跃的units，先将所有的position作为map的key，key对应的值set为空。map[0] = set<int>{1}，再从小到大遍历position，先判断该position是否能到达对岸position，能到达则返回true，不能到达，则更新该position后面的position的units

附加代码：

bool canCross(vector<int>& stones) {
    unordered_map<int,set<int>> mp;  //比选用map运行速度快%20，因为 .find 时间复杂度仅为 O(1)
    for(auto &units:stones)
    {
        mp[units]={};
    }
    mp[0].insert(1); //初始条件是 position 0 对应的step 必须是 1
    //遍历所有的position
    //for(auto p = mp.begin(); p != mp.end(); ++p)  //注意ordered_map不同map，默认key是不排序的，所以需要以stones遍历
    for(int i=0;i<stones.size();++i)
    {
        //判断当前的position是否可能到达对岸的position
        //不能到达彼岸则更新后续的position的step
        int curPosition = stones[i];
        for(auto &step:mp[curPosition])
        {
            int nextPosition = curPosition + step;
            if(nextPosition == stones.back())
                return true;
            else{
                if(mp.find(nextPosition) != mp.end()){
                    //更新nextPosition的step
                    mp[nextPosition].insert(step);
                    mp[nextPosition].insert(step + 1);
                    if(step - 1 > 0) mp[nextPosition].insert(step - 1);
                }
            }
        }
    }
    return false;
}

 

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

附加（注：非本人所写）目前最快速的方法，该方法运行效率比上一个方法快20~40倍！   自己去体会吧：

bool canCross(vector<int>& stones) {
        struct node {
            int units;
            int pos;
            bool operator<(const node& n) const {
                return pos < n.pos;
            }
        };
        int sz = stones.size();
        if(stones.size() > 1) {
            if(stones[1] - stones[0] > 1) return false;
            if(stones[sz - 1] > sz - 1 + stones[sz - 2]) return false;
        }
        
        priority_queue<node> q;
        q.push(node{1,0});
        
        while(!q.empty()) {
            node cur = q.top(); q.pop();
            if(cur.pos == stones.size() - 1)  return true;
            for(int i=cur.pos+1;i<stones.size();i++) {
                int diff = stones[i] - stones[cur.pos] - cur.units;
                if(diff >= -1 && diff <= 1) {
                    if(i == stones.size() - 1)  return true;
                    q.push(node{stones[i] - stones[cur.pos],i});
                } else if(diff > 1){ break; }
            }
        }
        return false;
    }