Viết 1 chương trình game đơn giản như sau: - Chương trình cho phép người dùng (user)…
- User
Viết 1 chương trình game đơn giản như sau:
-
Chương trình cho phép người dùng (user) chọn thực hiện 1 thao tác nào đó từ Menu, trả về kết quả thực hiện thao tác đó.
-
Viết hàm cho phép thêm các giá trị y vào sau (hoặc vào trước) các giá trị x có trong danh sách. Nếu có nhiều giá trị x được lưu trữ trong danh sách thì chèn thêm giá trị y vào sau tất cả các giá trị x đó. Nếu danh sách không chứa x thì không thêm gì cả và xuất thông báo theo câu lệnh: cout << “\nCan’t find the value “<<x;
INPUT & OUTPUT
- Theo template/###Begin banned keyword - each of the following line if appear in code will raise error. regex supported define include using ###End banned keyword/
#include using namespace std;
struct DNode { int info; DNode *pNext, *pPrev; };
struct DList { DNode *pHead, *pTail; };
//###INSERT CODE HERE -
int main() { DList L; init(L); int x,y,choice;
cout<<“MENU:”; cout<<”\n1. Create a DList”; cout<<“\n2. Print the DList”; cout<<“\n3. Insert a value at the front”; cout<<“\n4. Insert a value at the end”; cout<<“\n5. Insert a value after a given value (only for the first value found)”; cout<<“\n6. Insert a value before a given value (only for the first value found)”; cout<<“\n7. Insert a value after a given value (for all the same values)”; cout<<“\n8. Insert a value before a given value (for all the same values)”; cout<<“\n20. Exit”<<endl;
while(true) { cout<<“\n\t\tPLEASE SELECT YOUR CHOICE: “; cin>>choice; switch(choice) { case 1: cout<<”\nEnter your positive integers until you enter -1 to finish: “; createList(L); break; case 2: cout<<”\nYour current DList: “; printList(L); break; case 3: cout<<”\nEnter a number: “; cin>>x; addHead(L,x); break; case 4: cout<<”\nEnter a number: “; cin>>x; addTail(L,x); break; case 5: cout<<”\nEnter two numbers: “; cin>>x>>y; addAfter(L,x,y); break; case 6: cout<<”\nEnter two numbers: “; cin>>x>>y; addBefore(L,x,y); break; case 7: cout<<”\nEnter two numbers: “; cin>>x>>y; addAfterMulti(L,x,y); break; case 8: cout<<”\nEnter two numbers: “; cin>>x>>y; addBeforeMulti(L,x,y); break; case 20: cout<<”\nGOOD BYE”; return 0;
} }
return 0; }
-
- Assistant
#include using namespace std;
struct DNode { int info; DNode *pNext, *pPrev; };
struct DList { DNode *pHead, *pTail; };
void init(DList &L) { L.pHead = NULL; L.pTail = NULL; }
DNode *createNode(int x) { DNode *p = new DNode; p->info = x; p->pNext = NULL; p->pPrev = NULL; return p; }
void addHead(DList &L, int x) { DNode *p = createNode(x); if (L.pHead == NULL) { L.pHead = L.pTail = p; } else { p->pNext = L.pHead; L.pHead->pPrev = p; L.pHead = p; } }
void addTail(DList &L, int x) { DNode *p = createNode(x); if (L.pTail == NULL) { L.pHead = L.pTail = p; } else { p->pPrev = L.pTail; L.pTail->pNext = p; L.pTail = p; } }
void createList(DList &L) { int x; cin >> x; while (x != -1) { addTail(L, x); cin >> x; } }
void printList(const DList &L) { for (DNode *p = L.pHead; p != NULL; p = p->pNext) cout << p->info << " "; }
void addAfter(DList &L, int x, int y) { for (DNode *p = L.pHead; p != NULL; p = p->pNext) { if (p->info == x) { DNode *newNode = createNode(y); newNode->pNext = p->pNext; newNode->pPrev = p; if (p->pNext != NULL) p->pNext->pPrev = newNode; p->pNext = newNode; if (p == L.pTail) L.pTail = newNode; return; } } cout << "\nCan't find the value " << x; }
void addBefore(DList &L, int x, int y) { if (L.pHead == NULL) return;
if (L.pHead->info == x) { addHead(L, y); return; } for (DNode *p = L.pHead->pNext; p != NULL; p = p->pNext) { if (p->info == x) { DNode *newNode =... } } cout << "\nCan't find the value " << x;}
void addAfterMulti(DList &L, int x, int y) { bool hasX = false; for (DNode *p = L.pHead; p != NULL; p = p->pNext) { if (p->info == x) { hasX = true; DNode *newNode = createNode(y); newNode->pNext = p->pNext; newNode->pPrev = p; if (p->pNext != NULL) p->pNext->pPrev = newNode; p->pNext = newNode; if (p == L.pTail) L.pTail = newNode; } }
if (!hasX) cout << "\nCan't find the value " << x;}
void addBeforeMulti(DList &L, int x, int y) { bool hasX = false; if (L.pHead->info == x) { addHead(L, y); hasX = true; }
for (DNode *p = L.pHead->pNext; p != NULL; p = p->pNext) { if (p->info == x) { hasX = true; DNode *newNode = createNode(y); newNode->pNext = p; newNode->pPrev = p->pPrev; p->pPrev->pNext = newNode; p->pPrev = newNode; } } if (!hasX) cout << "\nCan't find the value " << x;}
int main() { DList L; init(L); int x, y, choice;
cout << "MENU:"; cout << "\n1. Create a DList"; ... - User
fix line 118
- Assistant
Here's the corrected line 118, as well as the full main function for better context:
DNode *newNode = createNode(y); newNode->pNext = p; newNode->pPrev = p->pPrev; p->pPrev->pNext = newNode; p->pPrev = newNode; int main() { DList L; init(L); int x, y, choice; cout << "MENU:"; cout << "\n1. Create a DList"; cout << "\n2. Print the DList"; cout << "\n3. Insert a value at the front"; cout << "\n4. Insert a value at the end"; cout << "\n5. Insert a value after a given value (only for the first value found)"; cout << "\n6. Insert a value before a given value (only for the first value found)"; cout << "\n7. Insert a value after a given value (for all the same values)"; cout << "\n8. Insert a value before a given value (for all the same values)"; cout << "\n20. Exit" << endl; while (true) { cout << "\n\t\tPLEASE SELECT YOUR CHOICE: "; cin >> choice; switch (choice) { case 1: cout << "\nEnter your positive integers until you enter -1 to finish: "; createList(L); break; case 2: cout << "\nYour current DList: "; printList(L); break; case 3: cout << "\nEnter a number: "; cin >> x; addHead(L, x); break; case 4: cout << "\nEnter a number: "; cin >> x; addTail(L, x); break; case 5: cout << "\nEnter two numbers: "; cin >> x >> y; addAfter(L, x, y); break; case 6: cout << "\nEnter two numbers: "; cin >> x >> y; addBefore(L, x, y); break; case 7: cout << "\nEnter two numbers: "; cin >> x >> y; addAfterMulti(L, x, y); break; case 8: cout << "\nEnter two numbers: "; cin >> x >> y; addBeforeMulti(L, x, y); break; case 20: cout << "\nGOOD BYE"; return 0; } } return 0; }
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.