帶頭結點的鏈式表操作集

2021-07-27 09:21:59 字數 2636 閱讀 2673

本題要求實現帶頭結點的鏈式表操作集。

函式介面定義:

list makeempty(); 

position

find( list l, elementtype x );

bool insert( list l, elementtype x, position p );

bool delete( list l, position p );

其中list結構定義如下:

typedef

struct lnode *ptrtolnode;

struct lnode ;

typedef ptrtolnode position;

typedef ptrtolnode list;

各個操作函式的定義為:

list makeempty():建立並返回乙個空的線性表;

position

find( list l, elementtype x ):返回線性表中x的位置。若找不到則返回error;

bool insert( list l, elementtype x, position p ):將x插入在位置p指向的結點之前,返回true。如果引數p指向非法位置,則列印「wrong position for insertion」,返回false;

bool delete( list l, position p ):將位置p的元素刪除並返回true。若引數p指向非法位置,則列印「wrong position for deletion」並返回false。

裁判測試程式樣例:

#include 

#include

#define error null

typedef

enum bool;

typedef

int elementtype;

typedef

struct lnode *ptrtolnode;

struct lnode ;

typedef ptrtolnode position;

typedef ptrtolnode list;

list makeempty();

position find( list l, elementtype x );

bool insert( list l, elementtype x, position p );

bool delete( list l, position p );

int main()

scanf("%d", &n);

while ( n-- )

}flag = insert(l, x, null);

if ( flag==false ) printf("wrong answer\n");

else

printf("%d is inserted as the last element.\n", x);

p = (position)malloc(sizeof(struct lnode));

flag = insert(l, x, p);

if ( flag==true ) printf("wrong answer\n");

flag = delete(l, p);

if ( flag==true ) printf("wrong answer\n");

for ( p=l->next; p; p = p->next ) printf("%d ", p->data);

return0;}

/* 你的**將被嵌在這裡 */

輸入樣例:

6 12 2 4 87 10 2

4 2 12 87 5

輸出樣例:

2 is found and deleted.

12 is found and deleted.

87 is found and deleted.

finding error: 5 is not in.

5 is inserted as the last element.

wrong position for insertion

wrong position for deletion

10 4 2 5

list makeempty()

position find( list l, elementtype x )

return l;

}bool insert( list l, elementtype x, position p )

if (l->next!=p)

l->next=(list)malloc(sizeof(struct lnode));

l->next->

data

=x; l->next->next=p;

return

true;

}bool delete( list l, position p )

while (l->next)

if (l->next!=p)

l->next=p->next;

return

true;

}

帶頭結點的鏈式表操作集

本題要求實現帶頭結點的鏈式表操作集。函式介面定義 list makeempty position find list l,elementtype x bool insert list l,elementtype x,position p bool delete list l,position p 其...

帶頭結點的鏈式表操作集

include include define error null typedef enum bool typedef int elementtype typedef struct lnode ptrtolnode struct lnode typedef ptrtolnode position t...

帶頭結點的鏈式表操作集

帶頭結點的鏈式表操作集 20 分 本題要求實現帶頭結點的鏈式表操作集。list makeempty position find list l,elementtype x bool insert list l,elementtype x,position p bool delete list l,po...