作业社区
探索学习新天地，共享知识资源！
weixin_慕哥3021856 的学生作业：
#include #include #include using namespace std; class Time{ private: string hour; string minute; string second; public: void setHour(string hours); void setMinute(string minutes); void setSecond(string seconds); void printf_time(); }; void Time::setHour(string hours) { int hoursin = atoi(hours.c_str()); if (0
+88
阿大月 的学生作业：
main.c #include "head.h" int main() { sqe_stack *s = create_stack_list(); int i=0; printf("请按照顺序输入字符："); for (i=0;itop > -1){ printf("%c", s->chs[s->top--]); } return 0; } head.h #ifndef __HEAD_H__ #define __HEAD_H__ #include #include #include #define MAX 12 typedef struct { char chs[MAX]; int top; } sqe_stack; extern sqe_stack *create_stack_list(); extern void push_stack_to_top(sqe_stack *s, char data); extern char pop_stack_list(sqe_stack *s); extern int is_empty_stack(sqe_stack *s); extern int is_full_stack(sqe_stack *s); #endif sqestack.c #include "head.h" sqe_stack *create_stack_list() { sqe_stack *s = (sqe_stack *)malloc(sizeof(sqe_stack)); if (NULL == s){ printf("malloc is failed\n"); return NULL; } memset(s, 0, sizeof(sqe_stack)); s->top = -1; return s; } void push_stack_to_top(sqe_stack *s, char data) { s->chs[++s->top] = data; } char pop_stack_list(sqe_stack *s) { return s->chs[s->top--]; } int is_empty_stack(sqe_stack *s) { return s->top == -1? 1: 0; } int is_full_stack(sqe_stack *s) { return s->top == MAX - 1?1: 0; }
+12
阿大月 的学生作业：
main.c #include "head.h" int main() { loopnode *l = NULL; int num = 0, i, data; int k, m; loopnode *kl = NULL, *ml = NULL; printf("请确认要输入的值的个数："); scanf("%d", &num); printf("请输入要键入的值："); for (i=0;idata); while (kl != NULL){ i = 1; for (i=1;inext; } printf("跨度之后的kl->data: %d\n", kl->data); kl = delete_loop_node(&l, kl); } return 0; } head.h #ifndef __HEAD_H__ #define __HEAD_H__ #include #include #include typedef struct node { int data; struct node* next; } loopnode; loopnode* create_loop_node(int data); loopnode* insert_loop_node(loopnode *l, int data); loopnode* delete_loop_node(loopnode **l, loopnode *delete_node); void print_loop_list(loopnode *l); loopnode* search_loop_node(loopnode *l, int n); #endif loop_list.c #include "head.h" loopnode* create_loop_node(int data) { loopnode *l = (loopnode *)malloc(sizeof(loopnode)); if (NULL == l){ printf("malloc is failed\n"); return NULL; } l->data = data; l->next = NULL; return l; } loopnode* insert_loop_node(loopnode *l, int data) { //如果是空指针表示一个元素都没有，创建头结点，并把第一个值存入到头结点中 if (NULL == l){ printf("空指针\n"); l = create_loop_node(data); l->data = data; l->next = l; return l; } loopnode *tmp = create_loop_node(data); loopnode *current = l; do{ if (current->next == l || (data > current->data && data next->data )){ break; } current = current->next; }while(current != l); tmp->next = current->next; current->next = tmp; if (data < l->data){ l = tmp; } return l; } loopnode* delete_loop_node(loopnode **pl, loopnode *delete_node) { if (NULL == pl && NULL == delete_node ){ printf("空指针\n"); return; } loopnode *p = *pl; do{ if (p->next == delete_node){ printf("%d\n", delete_node->data); if (p->next == p){ free(p); p = NULL; }else{ p->next = delete_node->next; free(delete_node); } if (delete_node == *pl) *pl = p; delete_node = NULL; break; } p = p->next; }while (NULL != p); return NULL == *pl? NULL: p->next; } void print_loop_list(loopnode *l) { if (NULL == l){ printf("空指针\n"); return; } loopnode *p = l; do{ printf("%d ", p->data); p = p->next; }while (p != l); printf("\n"); } loopnode* search_loop_node(loopnode *l, int n) { if (NULL == l){ printf("空指针\n"); return; } int i = 1; loopnode *p = l; for (i=1;inext; } return p; }
+11