2019秋招米哈游程序类B卷编程题

最新推荐文章于 2024-08-17 23:17:38 发布

叼着烟卷的仙人

最新推荐文章于 2024-08-17 23:17:38 发布

阅读量2.5k

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/ztt_1105/article/details/102490971

版权

算法专栏收录该内容

5 篇文章 0 订阅

订阅专栏

本文探讨了两种算法实现：一是判断一组连续输入的整数是否构成连续序列，二是实现消消乐游戏的基本消除逻辑。前者通过检查序列中数字的最小值和最大值之间的差是否等于元素数量减一来判断连续性；后者则通过查找并标记三连相同的字符进行消除，计数并更新游戏矩阵。

摘要由CSDN通过智能技术生成

1.连续组合数字

#include<iostream>
#include<vector>
using namespace std;
int main() {
 int n;
 cin >> n;
 int count = 0;
 int m = n;
 vector<int> data(n);
 vector<int> set(n,0);
 for (int i = 0; i < n; i++) {
  cin >> data[i];
  
 }
 int max = data[0];
 int min = data[0];
 for (int i = 0; i < n; i++) {
  if (data[i] == 0) {
   count++;
  }
  else if (max < data[i]) max = data[i];
  else if (min > data[i]) min = data[i];
 }
 
 
 if (count >= n - 1) {
  cout << "YES" << "+" << count << endl;

 }
 else if (max - min != n - 1) {
 
 }
 else {
  for (int i = 0; i < n; i++) {
   if (data[i] != 0) {
    if (set[data[i] - min] == 1) {
     cout << "NO" << "+" << count << endl;
     break;
    }
    set[data[i] - min]++;
   }
   
  }
  cout << "YES" << "+" << count << endl;
 }
 //system("pause");
 return 0;
}

2.消消乐实现

题目：

#include<iostream>
#include<vector>
using namespace std;
int main() {
 int R, C;
 cin >> R >> C;
 char ch;
 vector<vector<char> > mat(R,vector<char>(C));
 for (int i = 0; i < R; i++) {
  for (int j = 0; j < C; j++) {
   cin >> ch;
   mat[i][j] = ch;
  }
 }
 struct point {
  int x;
  int y;
 }pt;
 vector<point> sw(2);
 for (int i = 0; i < 2; i++) {
  cin >> sw[i].x >> sw[i].y;
 }
 char temp;
 temp = mat[sw[0].x][sw[0].y];
 mat[sw[0].x][sw[0].y] = mat[sw[1].x][sw[1].y];
 mat[sw[1].x][sw[1].y] = temp;

 vector<vector<int>> flag(R,vector<int>(C,0));
 for (int i = 0; i < R; i++) {
  for (int j = 0; j < C; j++) {
   if ((i + 1 < R) && (i + 2 < R)) {
    if (mat[i][j] == mat[i + 1][j] && mat[i][j] == mat[i + 2][j]) {
     flag[i][j] = 1;
     flag[i+1][j] = 1;
     flag[i+2][j] = 1;

    }
   }
   if ((j + 1 < C) && (j+ 2 < C)) {
    if (mat[i][j] == mat[i][j+1] && mat[i][j] == mat[i][j+2]) {
     flag[i][j] = 1;
     flag[i][j + 1] = 1;
     flag[i][j + 2] = 1;

    }


   }
  }
 }
 int count = 0;
 for (int i = 0; i < R; i++) {
  for (int j = 0; j < C; j++) {
   if (flag[i][j] == 1) {
    mat[i][j] = '0';
    count += 1;
   }
  }
 }

 cout << count << endl;
 system("pause");
 return 0;
}