摘要: 1、生存空间和生存范围 看下面代码:vector<int> fibon_seq(int size){ if(size <= 0 || size >= 1024) { size = 8; } vector<int> elems(size); for(int ix = 0; ix < size; ++ix) { if( ix == 0 || ix == 1) elems[ix] = 1; else elems[ix] = elems[ix-1] + elems[ix-2]; ... 阅读全文
posted @ 2013-03-30 11:47 wiessharling 阅读(187) 评论(0) 推荐(0)