作业社区
探索学习新天地，共享知识资源！
慕哥0344532 的学生作业：
Player.hpp #ifndef __PLAYER_HEAD__ #define __PLAYER_HEAD__ #include class Player{ public: Player(const string &name,const string &color):name(name),color(color){ } string getName() const{ return name; } string getColor() const{ return color; } virtual bool playChess(int x,int y)=0; private: string name; string color; }; #endif BlackPlayer.hpp #ifndef __BLACK_PLAYER_HEAD__ #define __BLACK_PLAYER_HEAD__ #include #include "Player.hpp" #include "Chess.hpp" #include "BlackChess.hpp" #include "ChessBoard.hpp" class BlackPlayer:public Player{ public: BlackPlayer(const string &name):Player(name,"black"){ } bool playChess(int x,int y){ ChessBoard* chessboard = ChessBoard::getInstance(); if(!(chessboard->isValidPosition(x,y))){ chessboard->placeChess(new BlackChess(x,y)); return true; } return false; } }; #endif WhitePlayer.hpp #ifndef __WHITE_PLAYER_HEAD__ #define __WHITE_PLAYER_HEAD__ #include #include "Player.hpp" #include "Chess.hpp" #include "WhiteChess.hpp" #include "ChessBoard.hpp" using namespace std; class WhitePlayer:public Player{ public: WhitePlayer(const string &name):Player(name,"white"){ } bool playChess(int x,int y){ ChessBoard* chessboard = ChessBoard::getInstance(); if(!(chessboard->isValidPosition(x,y))){ chessboard->placeChess(new WhiteChess(x,y)); return true; } return false; } }; #endif main.cpp #include #include "Chess.hpp" #include "BlackChess.hpp" #include "WhiteChess.hpp" #include "ChessBoard.hpp" #include "WhitePlayer.hpp" #include "BlackPlayer.hpp" using namespace std; int main(){ // 显示棋盘 ChessBoard* chessboard = ChessBoard::getInstance(); chessboard->displayChessBoard(); ChessBoard::GC* gc = chessboard->createInner(); gc->cb = chessboard; // 设置内部类对象中的外部类指针 WhitePlayer whitePlayer("play01"); BlackPlayer blackPlayer("play02"); whitePlayer.playChess(17,9); blackPlayer.playChess(9,13); delete gc; } 运行结果【图片】
+42
weixin_慕哥3021856 的学生作业：
func.h #ifndef __FUNC_H_ #define __FUNC_H_ #include #ifdef __cplusplus extern "C"{ #endif extern char *mystrcpy(char *dest, const char *src); extern char *mystrcat(char *dest, const char *src); #ifdef __cplusplus } #endif #endif func.c #include "func.h" char *mystrcpy(char *dest, const char *src) { int i = 0; while (src[i] != '\0') { dest[i] = src[i]; i++; } return dest; } char *mystrcat(char *dest, const char *src) { int i = 0; int len = strlen(dest); while (src[i] != '\0') { dest[len++] = src[i++]; } return dest; } main.cpp #include #include "func.h" using namespace std; int main(int argc, const char *argv[]) { char strd[100] = {0}; char strs[100] = {0}; mystrcpy(strs, "hello world!"); cout
+76
阿大月 的学生作业：
main.c #include "head.h" int main() { linknode *head = create_empty_linklist(); int num = 0, i; int delete_data; printf("请确认要输入的数字的个数："); scanf("%d", &num); for (i=0;idata)); while (p->next != NULL && p->next->data < tmp_node->data){ p = p->next; } tmp_node->next = p->next; p->next = tmp_node; return; } void print_linklist(linknode *head) { if (NULL == head){ printf("head is a NULL pointer\n"); return; } linknode *p = head; while (p->next != NULL){ p = p->next; printf("%d ", p->data); } printf("\n"); return; } int is_empty_linklist(linknode *head) { return head->next == NULL? 1: 0; } void delete_node(linknode *head, int data) { if (NULL == head){ printf("指针为空\n"); return; } if (!is_empty_linklist){ printf("链表为空\n"); return; } linknode *p = head; linknode *q = NULL; int flag = 0; while (p->next != NULL){ if (p->next->data == data){ q = p->next; p->next = q->next; free(q); q = NULL; flag = 1; }else{ p = p->next; } } if (flag == 1){ printf("删除成功\n"); }else{ printf("没有找到要删除的值\n"); } return; } void reverse_linklist(linknode *head) { if (NULL == head){ printf("指针为空\n"); return; } if (!is_empty_linklist){ printf("链表为空\n"); return; } linknode *p = head->next->next; head->next->next = NULL; linknode *q = NULL; while (p != NULL){ q = p->next; p->next = head->next; head->next = p; p = q; } return; } void clear_linklist(linknode *head) { if (NULL == head){ printf("指针为空\n"); return; } if (!is_empty_linklist){ printf("链表为空\n"); return; } linknode *p = head; //当前要删除的节点 linknode *q = NULL; //当前节点的下一个 while (p != NULL){ q = p->next; print_linklist(q); free(p); p = q; } }
+13
阿大月 的学生作业：
main.c #include "head.h" int main() { linknode *head = create_empty_linklist(); int num = 0, i; int delete_data; printf("请确认要输入的数字的个数："); scanf("%d", &num); for (i=0;idata)); while (p->next != NULL && p->next->data < tmp_node->data){ p = p->next; } tmp_node->next = p->next; p->next = tmp_node; return; } void print_linklist(linknode *head) { if (NULL == head){ printf("head is a NULL pointer\n"); return; } linknode *p = head; while (p->next != NULL){ p = p->next; printf("%d ", p->data); } printf("\n"); return; } int is_empty_linklist(linknode *head) { return head->next == NULL? 1: 0; } void delete_node(linknode *head, int data) { if (NULL == head){ printf("指针为空\n"); return; } if (!is_empty_linklist){ printf("链表为空\n"); return; } linknode *p = head; linknode *q = NULL; int flag = 0; while (p->next != NULL){ if (p->next->data == data){ q = p->next; p->next = q->next; free(q); q = NULL; flag = 1; }else{ p = p->next; } } if (flag == 1){ printf("删除成功\n"); }else{ printf("没有找到要删除的值\n"); } return; }
+14
