改写用c++顺序表实现：#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, int...-Go服务器开发

#include #include #include using namespace std;

struct LNode {

int month;
int day;
string name;
double price;
LNode* next;

LNode() {}

LNode(int a, int b, 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;
}

List()
{
    init();
}

~List() {

   while (head)
   {
       LNode* p = head->next;
       delete head;
       head = p;
   }

};

void insert(int& a, int& b, 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, 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;

   if (p == nullptr)
       return e;

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

};

int main() {

int m, n;
string str, c;
double d;

List L1;

double ave1 = 0.0, ave2 = 0.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.0;
 int count1 = 0;

 double sum2= 0.0 ;
 int count2= 0 ;

 LNode* p = L1.head->next;

 while (p && count1 < n)
 {
     if (p->name == "keyboard")
     {
         sum1 += p->price;
         count1++;
     }

    p = p->next;
}

LNode* s = L1.head->next;

while (s && count2 < n)
{
    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助手提供，问题来源于学员提问