6 6 帶頭結點的鏈式表操作集 20分

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

函式介面定義：

list makeempty()

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

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;
}/* 你的**將被嵌在這裡 */

612 2 4 87 10 2

42 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 error;
}bool insert
( list l, elementtype x, position p )
l=l->next;
}printf
("wrong position for insertion\n");
return false;
}bool delete
( list l, position p )
l=l->next;
}printf
("wrong position for deletion\n");
return false;
}

這次寫得很快。

6 6 帶頭結點的鏈式表操作集 20分

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

6 6 帶頭結點的鏈式表操作集 20分

list makeempty position find list l,elementtype x bool insert list l,elementtype x,position p bool delete list l,position p 其中list結構定義如下 typedef struc...

6 6 帶頭結點的鏈式表操作集 20分

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