【奇妙的数据结构世界】 用经典例题对数组进行全面分析 | C++

#include<iostream>
using namespace std;
int tree_num[10001];
class tree {
public:
  int l,m;
  int u[101], v[101];
  void calculator()
  {
  for (int i = 0; i < m; i++)
  {
    for (int j = u[i]; j <= v[i]; j++)
    {
    tree_num[j] = 1;
    }
  }
  int count = 0;
  for (int k = 0; k <= l; k++)
  {
    if (tree_num[k] == 0)
    count++;
  }
  cout << "剩余" << count << "棵树" << endl;
  }
};
void text()
{
  tree t;
  cout << "请输入马路的长度:";
  cin >> t.l; 
  cout << "请输入区域的个数:";
  cin >> t.m;
  cout << "请开始分别输入" << t.m << "个区域的始点和终点坐标" << endl;
  for (int i = 0; i < t.m; i++)
  {
  cin >> t.u[i] >> t.v[i];
  }
  t.calculator();
}
int main()
{
  text();
}

#include<iostream>
using namespace std;
int number[1001];
class lottery {
public:
  int n;
  int arr_1[7];
  int arr_2[1001][7];
  void calculator_1()
  {
  for (int i = 0; i < n; i++)
  {
    int count = 0;
    int ans = 0;
    while (ans < 7)
    {
    for (int j = 0; j < 7; j++)
    {
      if (arr_2[i][j] == arr_1[ans])
      count++;
    }
    ans++;
    }
    number[i] = count;
  }
  }
  void calculator_2()
  {
  int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0;
  for (int i = 0; i < n; i++)
  {
    switch (number[i])
    {
    case 1:
    g++;
    break;
    case 2:
    f++;
    break;
    case 3:
    e++;
    break;
    case 4:
    d++;
    break;
    case 5:
    c++;
    break;
    case 6:
    b++;
    break;
    case 7:
    a++;
    break;
    }
  }
  cout << "分别对应中奖情况如下：(特等-一等-二等-三等-四等-五等-六等)" << endl;
  cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << " " << g << endl;
  }
};
void text()
{
  lottery l;
  cout << "请输入购买彩票的张数：";
  cin >> l.n;
  cout << "请输入彩票的7位中奖号码：";
  for (int i = 0; i < 7; i++)
  {
  cin >> l.arr_1[i];
  }
  cout << "请输入购买彩票的号码：" << endl;
  for (int i = 0; i < l.n; i++)
  {
  for (int j = 0; j < 7; j++)
  {
    cin >> l.arr_2[i][j];
  }
  }
  l.calculator_1();
  l.calculator_2();
}
int main()
{
  text();
}

#include<iostream>
using namespace std;
#define max 21
int sq[max][max][max] = {0};
class art {
public:
  int w, x, h;
  int x1, y1, z1;
  int x2, y2, z2;
  void calculator_1()
  {
  for (int i = x1; i <= x2; i++)
    for (int j = y1; j <= y2; j++)
    for (int k = z1; k <= z2; k++)
      sq[i][j][k] = 1;
  }
  void calculator_2()
  {
  int count=0;
  for (int i = 1; i <= w; i++)
    for (int j = 1; j <= x; j++)
    for (int k = 1; k <= h; k++)
      if (sq[i][j][k] == 0)
      count++;
  cout << "剩余" << count << "个小方块" << endl;
  }
};
void text()
{
  art a;
  cout << "请输入长宽高：";
  cin >> a.w >> a.x >> a.h;
  cout << "请输入q的值:";
  int q; cin >> q;
  cout << "请分别输入两组对角点的坐标值" << endl;
  for (int num = 1; num <= q; num++)
  {
   cin >> a.x1 >>a.y1 >> a.z1;
   cin >> a.x2 >>a.y2>> a.z2;
   a.calculator_1();
  }
  a.calculator_2();
}
int main()
{
  text();
}