6 5 鏈式表操作集 20分

2021-10-08 02:24:29 字數 2901 閱讀 3426

本題要求實現鏈式表的操作集。

position find

( list l, elementtype x )

;list insert

( list l, elementtype x, position p )

;list delete

( list l, position p )

;

其中list結構定義如下:

typedef

struct lnode *ptrtolnode;

struct lnode

;typedef ptrtolnode position;

typedef ptrtolnode list;

各個操作函式的定義為:

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

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

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

#include

#include

#define error null

typedef

int elementtype;

typedef

struct lnode *ptrtolnode;

struct lnode

;typedef ptrtolnode position;

typedef ptrtolnode list;

position find

( list l, elementtype x )

;list insert

( list l, elementtype x, position p )

;list delete

( list l, position p )

;int

main()

scanf

("%d"

,&n)

;while

( n--)}

l =insert

(l, x,

null);

if( l==error )

printf

("wrong answer\n");

else

printf

("%d is inserted as the last element.\n"

, x)

; p =

(position)

malloc

(sizeof

(struct lnode));

tmp =

insert

(l, x, p);if

( tmp!=error )

printf

("wrong answer\n");

tmp =

delete

(l, p);if

( tmp!=error )

printf

("wrong answer\n");

for( p=l; p; p = p->next )

printf

("%d "

, p->data)

;return0;

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

輸入樣例:

6122

487102

421287

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 deletion104

25

position find

( list l, elementtype x )

//查詢x第一次出現的位置

p=p->next;

}return error;

}list insert

( list l, elementtype x, position p )

//插入函式

while

(p!=

null

)else

}printf

("wrong position for insertion\n");

return error;

}list delete

( list l, position p )

while

(p!=

null

) p=p->next;

}printf

("wrong position for deletion\n");

return error;

}

6 5 鏈式表操作集 20分

本題要求實現鏈式表的操作集。函式介面定義 position find list l,elementtype x list insert list l,elementtype x,position p list delete list l,position p 其中list結構定義如下 typedef...

6 5 鏈式表操作集 20分

函式介面定義 position find list l,elementtype x list insert list l,elementtype x,position p list delete list l,position p 其中list結構定義如下 typedef struct lnode ...

6 5 鏈式表操作集 20分

本題要求實現鏈式表的操作集。函式介面定義 position find list l,elementtype x list insert list l,elementtype x,position p list delete list l,position p 其中list結構定義如下 typedef...