The yundingzhishang's blog

The goal in these three yearsThe first of allEacape the influence of othersFind the happiness of technologyBe myself don’t care about others eyesAbandon something may effect me such as gamesDo more... Continue reading...

链表的基本操作有头节点的尾插单链表先建头节点，头节点没有存放数据，尾插是从左往右需要3个结构指针 #include #include typedef struct Node { int x; struct Node* next; }node; int main() { node* head; node* p; node*q; head... Continue reading...

递归方法归纳判断是否为递归问题取决于是否每次执行的是相同的工作起到相同的功能例如汉诺塔中的每次n个碟子移动时，总是需要先将n-1个碟子移到中间碟子中可以用一般式n表示该问题 总结1.结束时的条件2.分析一层递归需要实现的功能3.返回值是如何，传送给上一级的信息 汉诺塔 #include< iostream> using namespace std; void hanoi(int n, c... Continue reading...

最大连续子数列在线处理法在线处理法 #include < stdio.h> int main() { int arry[11]; int x, Maxsum = 0, Thissum = 0; for (x = 0; x Maxsum)Maxsum = Thissum; else if (Thissum < 0)This... Continue reading...