bool CheckBlock(int x1,int y1,int x2,int y2) //进入此函数要求两个块为同一张图
{
bool returnValue = false;
HPEN hPen = CreatePen(PS_SOLID,3,RGB(0,255,0));
SelectObject(hDC,hPen);
bool bl = true;
int blockCountOfLine = 0;
if(GetBlockCountOfLine(x1,y1,x2,y2)==2) //直线
{
MoveToEx( hDC, map[x1][y1].x+20, map[x1][y1].y+20, NULL);
LineTo( hDC, map[x2][y2].x+20, map[x2][y2].y+20);
Sleep(200);
returnValue = true;
}
if(returnValue==false) //两折
{
blockCountOfLine = GetBlockCountOfLine(x1,y1,x2,y1) + GetBlockCountOfLine(x2,y1,x2,y2);
if(blockCountOfLine==2)
{
returnValue = true;
MoveToEx( hDC, map[x1][y1].x+20, map[x1][y1].y+20, NULL);
LineTo( hDC, map[x2][y1].x+20, map[x2][y1].y+20);
MoveToEx( hDC, map[x2][y1].x+20, map[x2][y1].y+20, NULL);
LineTo( hDC, map[x2][y2].x+20, map[x2][y2].y+20);
Sleep(200);
}
}
if(returnValue==false) //两折
{
blockCountOfLine = GetBlockCountOfLine(x1,y1,x1,y2) + GetBlockCountOfLine(x1,y2,x2,y2);
if(blockCountOfLine==2)
{
returnValue = true;
MoveToEx( hDC, map[x1][y1].x+20, map[x1][y1].y+20, NULL);
LineTo( hDC, map[x1][y2].x+20, map[x1][y2].y+20);
MoveToEx( hDC, map[x1][y2].x+20, map[x1][y2].y+20, NULL);
LineTo( hDC, map[x2][y2].x+20, map[x2][y2].y+20);
Sleep(200);
}
}
if(returnValue==false)
for(int j=0;j<20;j++)//横
{
if(j==y1 || j==y2)
continue;
// MoveToEx( hDC, map[x1][y1].x+20, map[x1][y1].y+20, NULL);
// LineTo( hDC, map[x1][j].x+20, map[x1][j].y+20);
//
// MoveToEx( hDC, map[x1][j].x+20, map[x1][j].y+20, NULL);
// LineTo( hDC, map[x2][j].x+20, map[x2][j].y+20);
//
// MoveToEx( hDC, map[x2][j].x+20, map[x2][j].y+20, NULL);
// LineTo( hDC, map[x2][y2].x+20, map[x2][y2].y+20);
// Sleep(100);
blockCountOfLine = GetBlockCountOfLine(x1,j,x2,j) + GetBlockCountOfLine(x1,y1,x1,j) + GetBlockCountOfLine(x2,j,x2,y2);
if( blockCountOfLine == 2 )
{
MoveToEx( hDC, map[x1][y1].x+20, map[x1][y1].y+20, NULL);
LineTo( hDC, map[x1][j].x+20, map[x1][j].y+20);
MoveToEx( hDC, map[x1][j].x+20, map[x1][j].y+20, NULL);
LineTo( hDC, map[x2][j].x+20, map[x2][j].y+20);
MoveToEx( hDC, map[x2][j].x+20, map[x2][j].y+20, NULL);
LineTo( hDC, map[x2][y2].x+20, map[x2][y2].y+20);
Sleep(200);
returnValue = true;
break;
}
}
if(returnValue==false)
for(int i=0;i<15;i++)//纵
{
if(i==x1 || i==x2)
continue;
// MoveToEx( hDC, map[x1][y1].x+20, map[x1][y1].y+20, NULL);
// LineTo( hDC, map[i][y1].x+20, map[i][y1].y+20);
//
// MoveToEx( hDC, map[i][y1].x+20, map[i][y1].y+20, NULL);
// LineTo( hDC, map[i][y2].x+20, map[i][y2].y+20);
//
// MoveToEx( hDC, map[i][y2].x+20, map[i][y2].y+20, NULL);
// LineTo( hDC, map[x2][y2].x+20, map[x2][y2].y+20);
// Sleep(200);
blockCountOfLine = GetBlockCountOfLine(i,y1,i,y2) + GetBlockCountOfLine(x1,y1,i,y1) + GetBlockCountOfLine(i,y2,x2,y2);
if( blockCountOfLine == 2)
{
MoveToEx( hDC, map[x1][y1].x+20, map[x1][y1].y+20, NULL);
LineTo( hDC, map[i][y1].x+20, map[i][y1].y+20);
MoveToEx( hDC, map[i][y1].x+20, map[i][y1].y+20, NULL);
LineTo( hDC, map[i][y2].x+20, map[i][y2].y+20);
MoveToEx( hDC, map[i][y2].x+20, map[i][y2].y+20, NULL);
LineTo( hDC, map[x2][y2].x+20, map[x2][y2].y+20);
Sleep(200);
returnValue = true;
break;
}
}
DeleteObject(hPen);
return returnValue;
}
int GetBlockCountOfLine(int x1,int y1,int x2,int y2)
{
int count = 0;
if( x1!=x2 && y1!=y2)
{
// ShowBox("IsLineEmpty-->两点不在一条直线上");
return 3;
}
if(x1==x2)//同一行
{
for(int i=Min(y1,y2); i<=Max(y1,y2); i++)
{
if(map[x1][i].picNum != -1)
{
count ++;
}
}
}
else if(y1==y2)//同一列
{
for(int i=Min(x1,x2); i<=Max(x1,x2); i++)
{
if(map[i][y1].picNum != -1)
{
count ++;
}
}
}
return count;
}
CheckBlock
最新推荐文章于 2023-03-09 13:35:40 发布