写一段Dev c++代码，要求：1、实现链表的基本操作（初始化、插入、查找、销毁）。2、在主函数完成：（1）输入第一个多项式各项的系数和指数；（2）输入第二个多项式各项的系数和指数；（3）以上两个多项式求和；（4）屏幕输出求和结果（即打印结果多项式）；（5）删除多项式。

首先，你需要了解链表通常用于存储多项式的每一项，每个节点包含系数和指数。这是一个简单的例子，我们将使用单向链表实现这个功能： ```cpp #include <iostream> using namespace std; // 定义链表节点结构 struct PolynomialTerm { double coefficient; int exponent; PolynomialTerm* next; // 指向下一个节点 }; // 初始化链表头指针 PolynomialTerm* createList() { return new PolynomialTerm{0, 0, nullptr}; } // 插入新节点到链表 void insert(PolynomialTerm*& head, double coefficient, int exponent) { PolynomialTerm* newNode = new PolynomialTerm{coefficient, exponent, nullptr}; if (head == nullptr) { head = newNode; } else { PolynomialTerm* current = head; while (current->next != nullptr && current->exponent > exponent) { current = current->next; } newNode->next = current->next; current->next = newNode; } } // 查找链表中的特定项 bool search(PolynomialTerm* head, double targetCoefficient, int targetExponent) { PolynomialTerm* current = head; while (current != nullptr) { if (current->coefficient == targetCoefficient && current->exponent == targetExponent) { return true; } current = current->next; } return false; } // 输出多项式 void printPolynomial(PolynomialTerm* head) { PolynomialTerm* current = head; cout << "("; while (current != nullptr) { cout << current->coefficient << "x^" << current->exponent; if (current->next != nullptr) { cout << " + "; } current = current->next; } cout << ")"; } // 删除链表中的特定项 void deleteTerm(PolynomialTerm*& head, double coefficient, int exponent) { if (head == nullptr || search(head, coefficient, exponent)) { // 如果头节点或找到目标项 PolynomialTerm* temp = head; head = head->next; delete temp; } else { PolynomialTerm* current = head; while (current->next != nullptr && current->next->exponent > exponent) { current = current->next; } if (current->next != nullptr && current->next->coefficient == coefficient) { current->next = current->next->next; } } } int main() { PolynomialTerm* firstPoly = createList(); PolynomialTerm* secondPoly = createList(); // 输入并插入多项式 for (int i = 0; i < 2; ++i) { double coef, exp; cin >> coef >> exp; insert(i % 2 ? firstPoly : secondPoly, coef, exp); } // 求和 PolynomialTerm* sumPoly = createList(); PolynomialTerm* p1 = firstPoly; PolynomialTerm* p2 = secondPoly; while (p1 != nullptr || p2 != nullptr) { if (p1 != nullptr && (p2 == nullptr || p1->exponent < p2->exponent)) { insert(sumPoly, p1->coefficient, p1->exponent); p1 = p1->next; } else { insert(sumPoly, p2->coefficient, p2->exponent); p2 = p2->next; } } // 打印和 cout << "Sum of the polynomials:\n"; printPolynomial(sumPoly); // 删除某个多项式 double coefToRemove, expToRemove; cout << "\nEnter coefficient and exponent to delete from the sum: "; cin >> coefToRemove >> expToRemove; deleteTerm(sumPoly, coefToRemove, expToRemove); // 打印删除后的结果 cout << "\nAfter deletion:\n"; printPolynomial(sumPoly); // 销毁链表 destroyList(sumPoly); return 0; } // 假设的销毁链表函数，实际项目中应考虑内存管理 void destroyList(PolynomialTerm* head) { if (head != nullptr) { destroyList(head->next); delete head; } } ``` 这段代码实现了链表的初始化、插入、查找、求和、删除以及输出多项式的功能。注意这只是一个简化版本，实际情况可能会需要处理更多边界条件和错误情况。