第七色在线视频,2021少妇久久久久久久久久,亚洲欧洲精品成人久久av18,亚洲国产精品特色大片观看完整版,孙宇晨将参加特朗普的晚宴

為了賬號安全，請及時綁定郵箱和手機立即綁定

作業(yè)社區(qū)

探索學(xué)習(xí)新天地，共享知識資源！

0份 提交作業(yè)
0個 布置作業(yè)
0份 滿分作業(yè)
得分 100
學(xué)習(xí)任務(wù)

Yam8632482 的學(xué)生作業(yè)：

linklist.h // // Created by 張亞民 on 25-6-20. // #ifndef __LINKLIST_H__ #define __LINKLIST_H__ #include #include #include typedef int datatype_t; typedef struct node{ datatype_t data; struct node *next; }linknode_t; extern linknode_t *create_linklist(); extern void insert_head_linklist(linknode_t *head, datatype_t data); extern void insert_tail_linklist(linknode_t *head, datatype_t data); extern void insert_order_linklist(linknode_t *head, datatype_t data); extern void print_linklist(linknode_t *head); extern int delete_data_linklist(linknode_t *head, datatype_t data); extern void reverse_data_linklist(linknode_t *head); extern void clear_linklist(linknode_t *head); #endif //__LINKLIST_H__ linklist.c // // Created by 張亞民 on 25-6-20. // #include "linklist.h" linknode_t *create_linklist() { linknode_t *head = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == head) { printf("malloc fail!\n"); return NULL; } memset(head,0,sizeof(linknode_t)); head->next = NULL; return head; } void insert_head_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; temp->next = head->next; head->next = temp; return; } void insert_tail_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; while (head->next != NULL) { head = head->next; } temp->next = head->next; head->next = temp; return; } void insert_order_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; linknode_t *pre = head; while (pre->next != NULL && pre->next->data > data) { pre = pre->next; } temp->next = pre->next; pre->next = temp; return; } void print_linklist(linknode_t *head) { linknode_t *p = head; while (p->next != NULL) { printf("%d ",p->next->data); p = p->next; } printf("\n"); } int is_empty_linklist(linknode_t *head) { return head->next == NULL; } int delete_data_linklist(linknode_t *head, datatype_t data) { linknode_t *p = NULL; linknode_t *q = NULL; int flag = 0; if (is_empty_linklist(head)) { return -1; } p=head; while (p->next != NULL) { if (p->next->data == data) { q = p->next; p->next = p->next->next; free(q) ; flag = 1; q=NULL; }else { p=p->next; } } if (flag) { printf("delete data %d successfully!\n", data); } else { printf("data %d not exits!\n",data); return -1; } return 0; } void reverse_data_linklist(linknode_t *head) { linknode_t *p = NULL; linknode_t *q = NULL; p = head->next->next; head->next->next = NULL; while (p != NULL) { q = p->next; p->next = head->next; head->next = p; p = q; } return; } void clear_linklist(linknode_t *head) { linknode_t *p = head; linknode_t *q = NULL; while (p != NULL) { q = p->next; print_linklist(p); free(q); p = q; } return; } main.c #include "linklist.h" int main(void) { linknode_t *head = NULL; int n = 0,i = 0,ret = 0; datatype_t data; head = create_linklist(); printf("please input you want insert data number : "); scanf("%d",&n); for(i = 0;i < n;i++) { printf("please input %d data : ",i); scanf("%d",&data); insert_order_linklist(head,data); } print_linklist(head); // datatype_t num = 3; // ret = delete_data_linklist(head,num); // if(ret == 0) // printf("delete data success\n"); // else // printf("delete data failed\n"); reverse_data_linklist(head); print_linklist(head); clear_linklist(head); printf("cleared\n"); print_linklist(head); return 0; }

得分 100
討論題

Yam8632482 的學(xué)生作業(yè)：

linklist.h // // Created by 張亞民 on 25-6-20. // #ifndef __LINKLIST_H__ #define __LINKLIST_H__ #include #include #include typedef int datatype_t; typedef struct node{ datatype_t data; struct node *next; }linknode_t; extern linknode_t *create_linklist(); extern void insert_head_linklist(linknode_t *head, datatype_t data); extern void insert_tail_linklist(linknode_t *head, datatype_t data); extern void insert_order_linklist(linknode_t *head, datatype_t data); extern void print_linklist(linknode_t *head); extern int delete_data_linklist(linknode_t *head, datatype_t data); #endif //__LINKLIST_H__ linklist.c // // Created by 張亞民 on 25-6-20. // #include "linklist.h" linknode_t *create_linklist() { linknode_t *head = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == head) { printf("malloc fail!\n"); return NULL; } memset(head,0,sizeof(linknode_t)); head->next = NULL; return head; } void insert_head_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; temp->next = head->next; head->next = temp; return; } void insert_tail_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; while (head->next != NULL) { head = head->next; } temp->next = head->next; head->next = temp; return; } void insert_order_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; linknode_t *pre = head; while (pre->next != NULL && pre->next->data > data) { pre = pre->next; } temp->next = pre->next; pre->next = temp; return; } void print_linklist(linknode_t *head) { linknode_t *p = head; while (p->next != NULL) { printf("%d ",p->next->data); p = p->next; } printf("\n"); } int is_empty_linklist(linknode_t *head) { return head->next == NULL; } int delete_data_linklist(linknode_t *head, datatype_t data) { linknode_t *p = NULL; linknode_t *q = NULL; int flag = 0; if (is_empty_linklist(head)) { return -1; } p=head; while (p->next != NULL) { if (p->next->data == data) { q = p->next; p->next = p->next->next; free(q) ; flag = 1; q=NULL; }else { p=p->next; } } if (flag) { printf("delete data %d successfully!\n", data); } else { printf("data %d not exits!\n",data); return -1; } return 0; } main.c #include "linklist.h" int main(void) { linknode_t *head = NULL; int n = 0,i = 0,ret = 0; datatype_t data; head = create_linklist(); printf("please input you want insert data number : "); scanf("%d",&n); for(i = 0;i < n;i++) { printf("please input %d data : ",i); scanf("%d",&data); insert_order_linklist(head,data); } print_linklist(head); datatype_t num = 3; ret = delete_data_linklist(head,num); if(ret == 0) printf("delete data success\n"); else printf("delete data failed\n"); print_linklist(head); return 0; }

得分 100
討論題

Yam8632482 的學(xué)生作業(yè)：

linklist.h // // Created by 張亞民 on 25-6-20. // #ifndef __LINKLIST_H__ #define __LINKLIST_H__ #include #include #include typedef int datatype_t; typedef struct node{ datatype_t data; struct node *next; }linknode_t; extern linknode_t *create_linklist(); extern void insert_head_linklist(linknode_t *head, datatype_t data); extern void insert_tail_linklist(linknode_t *head, datatype_t data); extern void insert_order_linklist(linknode_t *head, datatype_t data); extern void print_linklist(linknode_t *head); #endif //__LINKLIST_H__ linklist.c // // Created by 張亞民 on 25-6-20. // #include "linklist.h" linknode_t *create_linklist() { linknode_t *head = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == head) { printf("malloc fail!\n"); return NULL; } memset(head,0,sizeof(linknode_t)); head->next = NULL; return head; } void insert_head_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; temp->next = head->next; head->next = temp; return; } void insert_tail_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; while (head->next != NULL) { head = head->next; } temp->next = head->next; head->next = temp; return; } void insert_order_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *) malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc fail!\n"); return; } temp->data = data; linknode_t *pre = head; while (pre->next != NULL && pre->next->data > data) { pre = pre->next; } temp->next = pre->next; pre->next = temp; return; } void print_linklist(linknode_t *head) { linknode_t *p = head; while (p->next != NULL) { printf("%d ",p->next->data); p = p->next; } printf("\n"); } main.c #include "linklist.h" int main(void) { linknode_t *head = NULL; int n = 0,i = 0,ret = 0; datatype_t data; head = create_linklist(); printf("please input you want insert data number : "); scanf("%d",&n); for(i = 0;i < n;i++) { printf("please input %d data : ",i); scanf("%d",&data); insert_order_linklist(head,data); } print_linklist(head); return 0; }

得分 100
學(xué)習(xí)任務(wù)

Yam8632482 的學(xué)生作業(yè)：

seqlist.h #ifndef __SEQLIST_H__ #define __SEQLIST_H__ #include #include #include #define MAXSIZE 10 typedef struct { char name[20]; int id; int score; }datatype_t; typedef struct { datatype_t buf[MAXSIZE]; int length; }seqlist_t; extern seqlist_t *seqlist_create(); extern int is_full_seqlist(seqlist_t *list); extern void insert_data_seqlist(seqlist_t *list,datatype_t data); extern void print_seqlist(seqlist_t *list); extern void delete_data_seqlist(seqlist_t *list,datatype_t data); extern int is_empty_seqlist(seqlist_t *list); #endif //__SEQLIST_H__ seqlist.c #include "seqlist.h" seqlist_t *seqlist_create() { seqlist_t *list = (seqlist_t *) malloc(sizeof(seqlist_t)); if (NULL == list) { printf("malloc fail!\n"); return NULL; } memset(list,0,sizeof(seqlist_t)); list->length = 0; return list; } int is_full_seqlist(seqlist_t *list) { return list->length == MAXSIZE; } void insert_data_seqlist(seqlist_t *list,datatype_t data) { list->buf[list->length] = data; list->length++; } void print_seqlist(seqlist_t *list) { for (int i = 0 ; i < list->length; i++) { printf("%s\t%d\t%d\t\n",list->buf[i].name,list->buf[i].id,list->buf[i].score); } } int is_empty_seqlist(seqlist_t *list) { return list->length == 0; } void delete_data_seqlist(seqlist_t *list,datatype_t data) { int i = 0,j = 0; if (is_empty_seqlist(list)) { printf("list is empty!\n"); return; } for (i = 0; i < list->length; i++) { if (list->buf[i].id != data.id) { list->buf[j] = list->buf[i]; j++; } } list->length = j; if (i == j) { printf("no such data!\n"); }else { printf("delele data %s\t%d\t%d\t success!\n",data.name,data.id,data.score); } } main.c #include "seqlist.h" int main(void) { seqlist_t *list = NULL; list = seqlist_create(); datatype_t data = {"zhangsan",1,100}; insert_data_seqlist(list,data); datatype_t data2 = {"jack",2,98}; insert_data_seqlist(list,data2); print_seqlist(list); delete_data_seqlist(list,data); print_seqlist(list); return 0; }

首頁上一頁1234567下一頁尾頁
微信客服

購課補貼
聯(lián)系客服咨詢優(yōu)惠詳情

 幫助反饋 APP下載

慕課網(wǎng)APP
您的移動學(xué)習(xí)伙伴

 公眾號

掃描二維碼
關(guān)注慕課網(wǎng)微信公眾號