作業(yè)社區(qū)
探索學(xué)習(xí)新天地，共享知識(shí)資源！
guzimou 的學(xué)生作業(yè)：
#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_empty_linklist(); extern void insert_tail_linklist(linknode_t *head, datatype_t data); extern void print_data_linklist(linknode_t *head); extern int is_empty_linklist(linknode_t *head); extern void reverse_data_linklist(linknode_t *head); extern void clean_up_linklist(linknode_t *head); #endif // DEBUG #include "linklist.h" linknode_t *create_empty_linklist() { linknode_t *head = (linknode_t *)malloc(sizeof(linknode_t)); if (NULL == head) { printf("mall is fall\n"); return NULL; } memset(head, 0, sizeof(linknode_t)); head->next = NULL; return head; } void insert_tail_linklist(linknode_t *head, datatype_t data) { linknode_t *temp = (linknode_t *)malloc(sizeof(linknode_t)); if (NULL == temp) { printf("malloc is fail\n"); return; } temp->data = data; linknode_t *p = head; while (p->next != NULL) { p = p->next; } temp->next = p->next; p->next = temp; return; } void print_data_linklist(linknode_t *head) { linknode_t *p = head; while (p->next != NULL) { printf("%d ", p->next->data); p = p->next; } printf("\n"); return; } int is_empty_linklist(linknode_t *head) { return head->next == NULL ? 1 : 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 clean_up_linklist(linknode_t *head) { linknode_t *p = head; linknode_t *q = NULL; while (p != NULL) { q = p->next; print_data_linklist(p); free(p); p = q; } return; } #include "linklist.h" int main(int argc, char const *argv[]) { datatype_t data; int n = 0, i = 0, ret = 0; linknode_t *head = create_empty_linklist(); printf("please input you want to data:"); scanf("%d", &n); printf("please input %d data :", n); for (i = 0; i < n; i++) { scanf("%d", &data); insert_tail_linklist(head, data); } print_data_linklist(head); reverse_data_linklist(head); clean_up_linklist(head); return 0; } please input you want to data:5 please input 5 data :1 3 5 7 9 1 3 5 7 9 9 7 5 3 1 7 5 3 1 5 3 1 3 1 1
+142
慕運(yùn)維8597106 的學(xué)生作業(yè)：
computer.hpp #ifndef __COMPUTER_H__ #define __COMPUTER_H__ #include using namespace std; class Computer { public: Computer(const string &typeName); ~Computer(); string getTypeName(); private: string typeName; }; Computer::Computer(const string &typeName) { cout
+66
慕運(yùn)維8597106 的學(xué)生作業(yè)：
#include #include using namespace std; class String { public: String(const char *str); String(const String &other); String &operator++(); String operator++(int); char &operator[](int index); ~String(void); void show(); int size(); private: char *str; int len = 0; }; String::String(const char *str) { cout str = new char[len]; strcpy(this->str, str); } } String::String(const String &other) { cout str = new char[len]; strcpy(this->str, other.str); } } int String::size() { return this->len; } String &String::operator++() { if (this->str) { for (char *p = this->str; p && *p; p++) { *p = *p + 1; } } cout str; p && *p; p++) { *p = *p + 1; } } return oldstr; } char &String::operator[](int index) { if (index < 0 || index >= this->len) { cout
+65