PTA 6 5 鏈式表操作集 詳解

2021-10-24 21:52:49 字數 2493 閱讀 3306

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

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);

return 0;

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

6

12 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

position find( list l, elementtype x )

l=l->next; //鍊錶向後查詢

} return error;

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

while(l!=null)

l=l->next; //若不滿足條件,繼續迴圈遍歷

} printf("wrong position for insertion\n"); //若上面條件沒有找到正確位置則表示指向了非法位置

return error;

}list delete( list l, position p )

while(l->next!=null)

l=l->next;

} printf("wrong position for deletion\n");

return error;

}

6 5 鏈式表操作集

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

6 5 鏈式表操作集

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

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...