C++连连看判定图形消除算法

// 连连看.cpp : Defines the entry point for the console application.//#include "stdafx.h"#include <iostream.h>#include <vector>#include <queue>  using namespace std; struct Point{  int x;  int y;}; int pushonelinespot(Point a,Point b,int c[6][6], queue<Point> &g)  //将a点可直线到达的点压入队列g中{  int i;  Point temp;  for(i=1;;i++)  //向下检测   { if((a.x+i)<=5&&c[a.x+i][a.y]==0)      {     temp.x=a.x+i;temp.y=a.y;       g.push(temp);}       else if(c[a.x+i][a.y]!=0&&(a.x+i)<=5)      {if((a.x+i)==b.x&&a.y==b.y) return 1;       else break;}     else break;    }   for(i=-1;;i--)   //向上检测   { if(c[a.x+i][a.y]==0&&(a.x+i)>=0)      { temp.x=a.x+i;temp.y=a.y;         g.push(temp);}     else if(c[a.x+i][a.y]!=0&&(a.x+i)>=0)      {if((a.x+i)==b.x&&a.y==b.y) return 1;       else break;}     else break;    }   for(i=1;;i++)   //向右检测   { if(c[a.x][a.y+i]==0&&(a.y+i)<=5)      { temp.x=a.x;temp.y=a.y+i;         g.push(temp);}     else if(c[a.x][a.y+i]!=0&&(a.y+i)<=5)      {if(a.x==b.x&&(a.y+i)==b.y) return 1;       else break;}     else break;    }   for(i=-1;;i--)  //向左检测   { if(c[a.x][a.y+i]==0&&(a.y+i)>=0)      { temp.x=a.x;temp.y=a.y+i;         g.push(temp);}     else if(c[a.x][a.y+i]!=0&&(a.y+i)>=0)      {if(a.x==b.x&&(a.y+i)==b.y) return 1;       else break;}     else break;    }   return 0;} bool shortestline(Point a,Point b,int c[6][6]){  if(c[a.x][a.y]==c[b.x][b.y])  {  Point temp;  queue<Point> X,Y,Z;  int i;  i=pushonelinespot(a,b,c,X);  if(i==1) return 1;  while(!X.empty())   { temp=X.front();X.pop();    i=pushonelinespot(temp,b,c,Y);    if(i==1) return 1; }  //第一次转弯   while(!Y.empty())    { temp=Y.front();Y.pop();     i=pushonelinespot(temp,b,c,Z);     if(i==1) return 1;}  //第二次转弯 cout<<"转弯路径大于两次"<<endl;   return 0;  } else if(c[a.x][a.y]==0||c[b.x][b.y]==0) {cout<<"图形已空，请重新输入："<<endl;}  else { cout<<"两图形不相同"<<endl;return 0;}} int main(){  int v,i,j;  int c[6][6]={{0,0,0,0,0,0},{0,1,3,3,4,0},{0,0,6,4,0,0},{0,4,0,2,1,0},{0,6,0,4,2,0},{0,0,0,0,0,0}};/*  for(i=0;i<6;i++)    {for(j=0;j<6;j++)  c[i][j]=0;}            //初始化二维数组  cout<<"请初始化数组矩阵："<<endl;  while(cin>>value)           //输入控制    {      for(i=0;i<6;i++)       {for(j=0;j<6;j++)         c[i][j]=value;}    } //初始化二维数组；//while*/  for(i=0;i<6;i++)    {   for(j=0;j<6;j++)   cout<<"    "<<c[i][j]<<"  ";cout<<endl;  }; Point a,b;      for(i=0;;i++)  {  int sum=0;  cout<<"请输入坐标："<<endl;    cin>>a.x>>a.y>>b.x>>b.y;   if(a.x>0&&a.x<5&&a.y>0&&a.y<5&&b.x>0&&b.x<5&&b.y>0&&b.y<5)   {  if(a.x==b.x&&a.y==b.y) {cout<<"不可输入相同坐标,请重新输入："<<endl;continue;} v=shortestline(a,b,c);    if(v==1) {  c[a.x][a.y]=0;c[b.x][b.y]=0;         cout<<"成功消除"<<endl; }   }    else cout<<"坐标输入有误，请重新输入:"<<endl;   for(i=0;i<6;i++)    {   for(j=0;j<6;j++)       sum+=c[i][j];  };  if(sum==0) break;   for(i=0;i<6;i++)    {   for(j=0;j<6;j++)   cout<<"    "<<c[i][j]<<"  ";cout<<endl;  }; }; cout<<"恭喜过关。"<<endl; getchar(); return 0;}