leetcode 403 青蛙过河

我不知道我的方法为啥会超时，然后照着官方题解写了一通hhh,再埋个坑吧 

class Solution {
public:
void can_Cross(vector<int>&stones, int current, map<int, set<int>>&mymap) {
		for (set<int>::iterator it = mymap[current].begin(); it != mymap[current].end(); it++) {
			for (int step = *it - 1; step <= *it + 1; step++)
				if (step > 0 && mymap.find(current + step) != mymap.end())
					mymap[current + step].insert(step);
		}
}

bool canCross(vector<int>& stones) {
	if (stones[1] >= 2)
		return false;
	map<int, set<int>>mymap;
	int N = stones.size();
	for (int i = 0; i < N ; i++) {
		set<int>myset = {};
		mymap.insert(pair<int, set<int>>(stones[i],myset));
	}
	mymap[0].insert(1);
	for (int i = 0; i < N-1; i++) {
		//cout << i << endl;
		can_Cross(stones, stones[i], mymap);
	}
	if (mymap[stones[N-1]].size()!=0)
		return true;
	return false;
}
};

 其实下面这种解法快而且内存消耗少，也是递归，更准确地说是深搜dfs,对比于官方题解中的第一种解法，其实在思路上非常非常相似（很有对比分析的价值）但是，在官方题解第一种解法中，每次都要从前面计算到后面。------我再好好想想吧

上面解法应该是在插入时消耗了很多时间。。。其实没有必要插入，而是深搜啊

class Solution {
private:
	set<int>SetStones;
public:
	bool recall(int nowNum, int step, int target) {
		if (nowNum + step + 1 == target || nowNum + step == target || nowNum + step - 1 == target)
			return true;
        for (int i = 1; i >= -1; i--) {
			if (step+i>0&&SetStones.find(nowNum + step + i) != SetStones.end() && recall(nowNum + step + i, step + i, target))
				return true;
         }
		return false;
	}
	bool canCross(vector<int>& stones) {
		if (stones.size()<2)
			return true;
		if (stones[1] != 1)
			return false;
		for (int i = 1; i<stones.size(); i++) {
			if (i > 3 && stones[i - 1] * 2 < stones[i]) {
				return false;
			}
			SetStones.insert(stones[i]);
		}
		return recall(1, 1, stones.back());
	}
};