#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<iostream>
#include <fstream>
using namespace std;
struct Node {
int Data;
struct Node* Next, * privous;
};
int length_Node(struct Node* L) {
int i = 0;
struct Node* p = L;
while (p->Next != NULL) {
i++;
p = p->Next;
}
return (i);
}
void Print(struct Node* L) {
struct Node* q;
int i = length_Node(L);
int j = 0;
q = L->Next;
while (j < i) {
printf("%d ", q->Data);
q = q->Next;
j++;
}
printf("");
}
void CreateList(struct Node*& L, int b[], int n) {
int i;
struct Node* p;
L = (struct Node*)malloc(sizeof(struct Node));
L->privous = L->Next = NULL;
for (i = 0; i < n; i++)
{
p = (struct Node*)malloc(sizeof(struct Node));
p->Data = b[i];
p->Next = L->Next;
if (L->Next != NULL)
L->Next->privous = p;
L->Next = p;
p->privous = L;
}
}
资源评论
