正在加载图片...
How about this u Calculating elements in every calling is not so efficient u We need only calculate them once, then pick the corresponding one vector<int>* fubon seq (int iLength if(X==0‖ⅸ==1) if (iLength <=0 iLength >= 1024) Elems[ix=1 cer<<“ ength”<< iLength < not supported, reset to 8 else < end Length = 8 Elems[iX]=Eems[ⅸX-1]+ ElemsⅨX2] vector<int> Elems( iLength ) for(intⅸ=0;ⅸ< iLength;ⅸ++) return &Elems; ProblemHow about this? ◼ Calculating elements in every calling is not so efficient ◼ We need only calculate them once, then pick the corresponding one vector<int>* fibon_seq(int iLength) { if (iLength <= 0 || iLength >= 1024) { cerr << “Length ” << iLength << “not supported, reset to 8” << endl; iLength = 8; } vector<int> Elems( iLength ); for (int iX = 0; iX < iLength; iX++) { if (iX == 0 || iX == 1) { Elems[iX] = 1; } else { Elems[iX] = Elems[iX-1] + Elems[iX-2]; } } return &Elems; }  Problem
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有