用顺序表实现此代码： #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服务器开发

下面是使用顺序表实现的代码：

”`cpp #ifndef NULL #define NULL 0 #endif #include #include #include using namespace std;

const int MAX_SIZE = 100; // 假设顺序表最大容量为100

struct LNode {

// 存储数据
int month;
int day;
string name;
double price;

};

class List { public:

int _size;
LNode data[MAX_SIZE];

List() { _size = 0; } // 构造函数

void insert(int& a, int& b, string& c, double& d)
{
    if (_size >= MAX_SIZE)
    {
        cout << "Error: The list is full!" << endl;
        return;
    }

    for (int i = _size; i > 0; --i) // 后移元素腾出位置插入新元素
    {
        data[i] = data[i - 1];
    }

    data[0].month = a;
    data[0].day = b;
    data[0].name = c;
    data[0].price = d;

    ++_size; // 更新长度
}

void print_L()
{
    for (int i = 0; i < _size; ++i)
    {
        cout << data[i].month << " " << data[i].day << " ";
    }

     cout << endl;
 }

 int located(int a, int b)
 {
     for (int i = 0; i < _size; ++i)
     {
         if (a < data[i].month)
         {
             return i + 1;
         }
         else if (a == data[i].month)
         {
             if (b < data[i].day)
             {
                 return i + 1;
             }
         }
     }

     return _size + 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, 0, 10);

    if (a >= 10)
        str.erase(0, 3);
    else
        str.erase(0, 2);

    int b = stoi(str, 0, 10);

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

//L1.print_L();

double sum1 = 0;
int count1 = 0;

double sum2 = 0;
int count2 = 0;

for (int i = 0; i < m; ++i)
{
    if (count1 >= n)
    {
        break;
    }
    else
    {
        if (L1.data[i].name == "keyboard")
        {
            sum1 += L1.data[i].price;
            ++count1;
        }
    }

    if (count2 >= n)
    {
        break;
    }
    else
    {
        if (L1.data[i].name == "mouse")
        {
            sum2 += L1.data[i].price;
            ++count2;
        }
   }

}

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

return 0; } “`

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