摘要： #line 1 "CLRS 10.2-8,非循环双链表"#include<stdio.h>#include<stdlib.h>typedef struct node{ int data; unsigned int np; //指针是32位}Node ,*PNode;typedef struct{ PNode head;}List,*PList;PList init_list()//初始化{ PList p; p=(PList)malloc(sizeof(List)); if(p) { p->head=(PNode)malloc(sizeof(N 阅读全文