c语言连连看算法,C++实现连连看消除算法

C++连连看消除代码的实现，过程比较复杂。

#include

#include

using namespace std;

bool CheckRemove(int x1,int y1,int x2,int y2,int rows,int cols,int ***pArray);

void Swap(int &a,int &b);

typedef struct

{

int x;

int y;

}point;

int main()

{

int Num=0;

while(Num<=15)

{

int m,n,t;

cin>>m>>n>>t;

int **store_num=new int*[m];

int **t_pos=new int*[t];

for(int i=0;i

{

store_num[i]=new int[n];

}

for(int i=0;i

{

for(int j=0;j

{

store_num[i][j]=0;

}

}

for(int i=0;i

{

t_pos[i]=new int[4];

}

for(int i=0;i

{

for(int j=0;j<4;j++)

{

t_pos[i][j]=0;

}

}

for(int i=0;i

{

for(int j=0;j

{

cin>>store_num[i][j];

}

}

for(int i=0;i

{

for(int j=0;j<4;j++)

{

cin>>t_pos[i][j];

}

}

int score=0;

for(int i=0;i

{

if(CheckRemove(t_pos[i][0],t_pos[i][1],t_pos[i][2],t_pos[i][3],m,n,&store_num))

{

score++;

}

}

cout<

Num++;

}

return 0;

}

bool CheckRemove(int x1,int y1,int x2,int y2,int rows,int cols,int ***pArray)

{

int m1=x1-1;int n1=y1-1;

int m2=x2-1;int n2=y2-1;

if((*pArray)[m1][n1]!=(*pArray)[m2][n2])

{

return false;

}

if(m1==m2&&(m1==0||m1==rows-1))

{

(*pArray)[m1][n1]=0;

(*pArray)[m2][n2]=0;

return true;

}

if(n1==n2&&(n1==0||n1==cols-1))

{

(*pArray)[m1][n1]=0;

(*pArray)[m2][n2]=0;

return true;

}

vectorv_point;

point p_in;

int **pArray_incre=new int*[rows+2];

for(int i=0;i

{

pArray_incre[i]=new int [cols+2];

}

for(int i=0;i

{

for(int j=0;j

{

pArray_incre[i][j]=0;

}

}

for(int i=1;i

{

for(int j=1;j

{

pArray_incre[i][j]=(*pArray)[i-1][j-1];

}

}

for(int y=y1+1;y

{

if(pArray_incre[x1][y]!=0)

{

break;

}

p_in.x=x1;

p_in.y=y;

v_point.push_back(p_in);

}

for(int y=0;y

{

if(pArray_incre[x1][y]!=0)

{

break;

}

p_in.x=x1;

p_in.y=y;

v_point.push_back(p_in);

}

for(int y=y2+1;y

{

if(pArray_incre[x2][y]!=0)

{

break;

}

p_in.x=x2;

p_in.y=y;

v_point.push_back(p_in);

}

for(int y=0;y

{

if(pArray_incre[x2][y]!=0)

{

break;

}

p_in.x=x2;

p_in.y=y;

v_point.push_back(p_in);

}

for(int i=0;i

{

for(int j=0;j

{

if(j!=i)

{

if(v_point[i].y==v_point[j].y)

{

int yy=v_point[i].y;

int xx1=v_point[i].x;

int xx2=v_point[j].x;

if(xx1>xx2)

Swap(xx1,xx2);

int num=xx2-xx1+1;

int count=0;

for(int h=xx1;h<=xx2;h++)

{

if(pArray_incre[h][yy]==0)

{

count++;

}

}

if(count==num)

{

(*pArray)[x1-1][y1-1]=0;

(*pArray)[x2-1][y2-1]=0;

v_point.empty();

return true;

}

}

}

}

}

v_point.empty();

for(int x=x1+1;x

{

if(pArray_incre[x][y1]!=0)

{

break;

}

p_in.x=x;

p_in.y=y1;

v_point.push_back(p_in);

}

for(int x=0;x

{

if(pArray_incre[x][y1]!=0)

{

break;

}

p_in.x=x;

p_in.y=y1;

v_point.push_back(p_in);

}

for(int x=x2+1;x

{

if(pArray_incre[x][y2]!=0)

{

break;

}

p_in.x=x;

p_in.y=y2;

v_point.push_back(p_in);

}

for(int x=0;x

{

if(pArray_incre[x][y2]!=0)

{

break;

}

p_in.x=x;

p_in.y=y2;

v_point.push_back(p_in);

}

for(int i=0;i

{

for(int j=0;j

{

if(j!=i)

{

if(v_point[i].x==v_point[j].x)

{

int xx=v_point[i].x;

int yy1=v_point[i].y;

int yy2=v_point[j].y;

if(yy1>yy2)

Swap(yy1,yy2);

int num=yy2-yy1+1;

int count=0;

for(int h=yy1;h<=yy2;h++)

{

if(pArray_incre[xx][h]==0)

{

count++;

}

}

if(count==num)

{

(*pArray)[x1-1][y1-1]=0;

(*pArray)[x2-1][y2-1]=0;

v_point.empty();

return true;

}

}

}

}

}

return false;

}

void Swap(int &a,int &b)

{

int tmp;

tmp=a;

a=b;

b=tmp;

}

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持我们。