qq_45569601的博客

c/c++ 递归模板以下是伪代码:void recur(int level, int param) { // terminator 递归终结者 if (level > MAX_LEVEL) { // process result 过程的结果 return; } // process current logic 当前一层的逻辑过程 process(level, param); // drill d

c/c++ 二分查找模板伪代码int length = array.size();int i = 0,j = length - 1;while (i <= j) { int middle = left + (right - left) >> 1; if (array[middle] == target) { //break or return ; } else if(array[middle] > target) { j = middl