用单链表的其他方法实现此代码： #ifndef NULL #define NULL 0 #endif #include #include #include using namespace std; struct LNode { //存储数据 int month; int day; string name; double price; LNode* next;//后继指针 LNode() {}; LNode(int a,...-Go服务器开发

以下是使用单链表的其他方法实现该代码：

#include <iostream>
#include <iomanip>
#include <string>
using namespace std;

struct LNode
{
    // 存储数据
    int month;
    int day;
    string name;
    double price;
    LNode* next;  // 后继指针

    LNode() {}
    LNode(int a, int b, const string& c, double d, LNode* n = nullptr)
        : month(a), day(b), name(c), price(d), next(n) {}
};

class List
{
public:
    int _size;
    LNode* head;

    void init()
    {
        head = new LNode;
        head->next = nullptr;
        _size = 0;
    }

public:
    List() { init(); }  // 构造函数
    ~List()
    {
        while (head)
        {
            LNode* p = head->next;
            delete head;
            head = p;
        }
    };  // 析构函数

	// 头插法
	void insert(int a, int b, const string& c, double d)
	{
		_size++;
		LNode* p = new LNode(a, b, c, d);
		p->next = head->next;
		head->next = p;
	};

	// 在指定位置插入元素
	void insert(int index, int a, int b, const string& c, double d)
	{
	    if(index <= 0 || index > _size + 1) return;

	    _size++;
	    LNode* p = head;

	    for (int i = 0; i < index - 1; i++)
	        p = p->next;

	    LNode* tmp = new LNode(a, b, c, d);
	    tmp->next = p->next;
	    p->next = tmp;
	};

	void print_L()
	{
	    LNode* p = head->next;

	    while (p)
	    {
	        cout << p->month << " " << p->day << " ";
	        p = p->next;
	    }
	    
        cout << endl;
	};

	int located(int a, int b)
	{
	    LNode* p = head->next;
    	int e = 1;

    	while (p)
    	{
    	    if (a < p->month)
    		{
    			e++;
    			p = p->next;

                if (!p) return e;
    		}
    		else if (a > p->month)
    		{
    			return e;
    		}
    		else if (a == p->month)
    		{
    			if (b < p->day)
    			{
    				e++;
    				p = p->next;

                    if (!p) return e;
    			}
    			else if (b > p->day)
    			{
    				return e;
    			}
    			else if (b == p->day)
    			{
    				return e;
    			}
            }
        }

        return -1; // 没有找到
    };
};

int main()
{
	int m, n;
	string str;
	string c;
	double d;
	List L1;

	double ave1 = 0;
	double ave2 = 0;

	cin >> m >> n;

	for (int i = 0; i < m; i++)
    {
        cin >> str >> c >> d;

        int a = stoi(str.substr(2));
        int b = stoi(str.substr(0, 2));

        int e = L1.located(a, b);
        L1.insert(e, a, b, c, d);
    }

    double sum1 = 0;
    int count1 = 0;
    double sum2 = 0;
    int count2 = 0;

    LNode* p = L1.head->next;

	for (int i = 0; i < m && count1 < n; i++)
	{
	    if (p->name == "keyboard")
	    {
	        sum1 += p->price;
	        count1++;
	    }

	    p = p->next;
	}

	LNode* s = L1.head->next;

	for (int i = 0; i < m && count2 < n; i++)
	{
	    if (s->name == "mouse")
	    {
	        sum2 += s->price;
	        count2++;
	    }

	    s = s->next;
	}

	cout << fixed << setprecision(1) << sum1 / n << endl;
	cout << fixed << setprecision(1) << sum2 / n << endl;

	return 0;
}

此实现使用了单链表的头插法和指定位置插入元素的方法，实现了与原始代码相同的功能。

内容由零声教学AI助手提供，问题来源于学员提问