Albert__Sun的博客

http://mp.weixin.qq.com/s?__biz=MzI2NjA3NTc4Ng==&mid=402962373&idx=1&sn=15589545f7072583d0f65f2f6b1f3840&scene=23&srcid=0315hG6Qnn14H0VOTjinKZCr#rd

八皇后问题-->回溯法，待补充

最大连续乘积子序列#include #define LENGTH 8#define min(n1, n2) (n1 > n2 ? n2 : n1)#define max(n1, n2) (n1 > n2 ? n1 : n2)double MaxProSub(double a[], int length);int main(){ double arr[LENGTH] = {-2.5, 4,

用循环和栈代替递归DemoQ：将上图的数据结构转换为如下要求：循环中嵌套递归：public function recursion($arr, $str){ for($i = 0; $i < count($arr); $i++){ $newstr = $str + '->'+ $arr[$i]['resource_n