P_Y_-优快云博客

原创 nodejs request模块302重定向解决办法

nodejs request模块302重定向解决办法有两种方法处理，下面以https://bbs.125.la/为例：1、开启记录cookie的 jarvar request = require('request');//开启记录cookie,重定向时自动带上cookierequest = request.defaults({jar: true})var options = {...

2020-04-12 12:07:19 6896 1

原创数据结构之八皇后问题

# include # include int count=0;void EightQueen(int ,int (*)[8] );bool danger(int ,int , int (*)[8] );int main(){ int chess[8][8]={0}; EightQueen(0, chess); return 0;}void EightQueen(i

2014-04-04 13:59:40 954

原创数据结构之简单表达式计算器(读入中缀转后缀，通过后缀计算结果)

# include # include # include # include typedef struct Node //中缀转后缀表达式使用的结点{ char str; struct Node * pNext;}NODE,* PNODE;typedef struct iNode //后缀表达式使用的结点{ double val; struct iNod

2014-04-02 11:15:06 921

原创数据结构之魔术师的发牌

# include # include typedef struct Node{ struct Node * pNext; int val; bool empty; //标志位，填入值后为false，否则为true}NODE,* PNODE;PNODE init();void magic(PNODE);void traverse(PNODE);int main(

2014-03-31 12:14:44 801

原创数据结构之约瑟夫问题

只为解决问题，没有细致到完善像空集等的工作，如有问题，请指正，谢谢# include # include typedef struct Node{ struct Node * pPrev; int Number; struct Node * pNext;}NODE,*PNODE;PNODE init();void traverse(PNODE);PNODE Kill

2014-03-27 10:07:21 822

原创数据结构之汉诺塔(递归)

# include void hanoi(int ,char ,char ,char );int main(){ int n; printf("请输入块数："); //块数最好不要太大，我输入20块已经要花很长时间，呵呵 scanf("%d",&n); hanoi(n,'A','B','C'); return 0;}void hanoi(int n,char x,ch

2014-03-17 10:12:54 903 1

原创数据结构之队列(数组队列)

# include # include #define Array_length 8typedef struct Queue{ int * pBase; int front; int rear;}QUEUE,* PQUEUE;void init(PQUEUE); //初始化队列bool in(PQUEUE,int); //入队bool out(PQUEUE,int

2014-03-14 11:44:44 878

原创数据结构之队列(链式队列)

# include # include typedef struct Node{ int val; struct Node * pNext;}NODE, * PNODE;typedef struct Queue{ PNODE front; PNODE rear;}QUEUE,* PQUEUE;void init(PQUEUE);void in(PQUEUE,int)

2014-03-14 08:47:55 706

原创数据结构之递归

# include int f(int n){if (1==n)return 1;elsereturn f(n-1)+n;//这里修改为*号，就成为100阶乘了}int main(){printf("%d\n",f(100)); //1-100累加return 0;}

2014-03-13 17:13:04 499

原创数据结构之栈

# include # include typedef struct Node{ int val; struct Node * pNext;}NODE,* PNODE;typedef struct Stack{ PNODE pTop; PNODE pBottom;}STACK,* PSTACK;void init(PSTACK); //初始化栈void push

2014-03-12 12:56:33 591

原创数据结构之链表

# include # include typedef struct note{ int data; struct note * pNext;}* PNODE,NODE;PNODE Create_List(void);void Traverse_List(PNODE);bool Is_Empty(PNODE);int Length_List(PNODE);bool In

2014-03-12 08:36:48 821

原创数据结构之数组

#include #include #define bool int;#define true 1;#define false 0;struct Arr{ int * pBase; //数组首地址 int len; //数组长度 int cnt; //数组元素有效个数};bool init_arr(struct Arr

2014-03-12 08:34:56 609

u013816098的专栏