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點(diǎn)可直線到達(dá)的點(diǎn)壓入隊(duì)列g(shù)中
{
  int i;
  Point temp;
  for(i=1;;i++)  //向下檢測(cè)
   { 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--)   //向上檢測(cè)
   { 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++)   //向右檢測(cè)
   { 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--)  //向左檢測(cè)
   { 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; }  //第一次轉(zhuǎn)彎
   while(!Y.empty())
    { temp=Y.front();Y.pop();
     i=pushonelinespot(temp,b,c,Z);
     if(i==1) return 1;}  //第二次轉(zhuǎn)彎
 cout<<"轉(zhuǎn)彎路徑大于兩次"<<endl;
   return 0;
  }
 else if(c[a.x][a.y]==0||c[b.x][b.y]==0) {cout<<"圖形已空，請(qǐng)重新輸入："<<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;}            //初始化二維數(shù)組
  cout<<"請(qǐng)初始化數(shù)組矩陣："<<endl;
  while(cin>>value)           //輸入控制
    {
      for(i=0;i<6;i++)
       {for(j=0;j<6;j++)
         c[i][j]=value;}
    } //初始化二維數(shù)組；//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<<"請(qǐng)輸入坐標(biāo)："<<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<<"不可輸入相同坐標(biāo),請(qǐng)重新輸入："<<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<<"坐標(biāo)輸入有誤，請(qǐng)重新輸入:"<<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<<"恭喜過(guò)關(guān)。"<<endl;
 getchar();
 return 0;
}