|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
平均成绩已经算好了,如何让这个链表在主函数中实现题目的意思呢,就是说
template<typename T>
struct Node {
T data;
Node* next;
Node(T value) : data(value), next(nullptr) {}
};
template<typename T>
class LinkedList {
private:
Node<T>* head;
Node<T>* tail;
public:
LinkedList() : head(nullptr), tail(nullptr) {}
~LinkedList() {
while (head != nullptr) {
Node<T>* temp = head;
head = head->next;
delete temp;
}
}
void insert(T value) {
Node<T>* newNode = new Node<T>(value);
if (head == nullptr) {
head = newNode;
tail = newNode;
}
else {
tail->next = newNode;
tail = newNode;
}
}
void display() const {
Node<T>* current = head;
while (current != nullptr) {
std::cout << current->data << " -> ";
current = current->next;
}
std::cout << "nullptr" << std::endl;
}
};
void swap(double &a, double &b)
{
if (a > b)
{
double temp = a;
a =b;
b = temp;
}
}
LinkedList<int> list;
void makelist(student students[])
{
double arr1[] = { 0 };
double arr2[] = { 0 };
double arr3[] = { 0 };
double arr4[] = { 0 };
double* begin1 = arr1;
double* end1 = arr1 + sizeof(arr1) / sizeof(arr1[0]);
double a = accumulate(begin1, end1, 0);
double* begin2 = arr2;
double* end2 = arr2 + sizeof(arr2) / sizeof(arr2[0]);
double b = accumulate(begin2, end2, 0);
double* begin3 = arr3;
double* end3 = arr3 + sizeof(arr3) / sizeof(arr3[0]);
double c = accumulate(begin3, end3, 0);
double* begin4 = arr4;
double* end4 = arr4 + sizeof(arr4) / sizeof(arr4[0]);
double d = accumulate(begin4, end4, 0);
swap(a, b);
swap(b, c);
swap(c, d);
swap(a, b);
swap(b, c);
list.insert(a);
list.insert(b);
list.insert(c);
list.insert(d);
list.display();
} |
|