网易笔试问题--跳格子

先贴上程序，过后总结

#include 
#include 
using namespace std;
class sol{
public:
	vector& way(int N, int M)
	{
		static vectorfoundTimes;
		static int time = 0;
		unsigned int loopOut = 0;
		vectorqs;
		for (int j = 2; j < N; ++j)
		{
			if ( N%j == 0)
				qs.push_back(j);
		}
		for (auto ite1=qs.begin(); ite1!=qs.end(); ++ite1)
		{
			if (NM)
				{
					--time;
					break;
				}
				else if(M == temp)
				{
					foundTimes.push_back(time+1);
					--time;
					break;
				} 
				else if (temp < M)
				{
					++time;
					way(temp, M);
					if (ite1 == qs.end() - 1)
						loopOut = 1;
					else loopOut = 0;
				}
			}
			else if (N == M)
			{
				foundTimes.push_back(time);
				--time;
				break;
			}
			else if (N > M)
			{
				--time;
				break;
			}
		}
		if (loopOut == 1)
			--time;
		return foundTimes;
	};
	int sellectMin(vectorT)
	{
		int min = 100000;
		for (auto ite = T.begin(); ite != T.end();ite++)
		{
			if (*ite != 0 && *ite < min)
				min = *ite;
		}
		return min;
	}
}ans;
int main(){
	int N1 = 4, M1 = 15;
	vectorak;
	ak=ans.way(N1, M1);
	int solution = ans.sellectMin(ak);
	if (solution == 100000)
		solution = -1;
	printf("最小步数为%d步\n", solution);
	for (auto ite = ak.begin(); ite != ak.end(); ite++)
		cout << *ite << "one possible answer" << endl;
	cin.get();
}