bsp; for (int y = 0; y <y1; y++) { if (Y直连(y, y1, x1) == true && 一折连(x1, y, x2, y2) == true && 地图[y * 尺寸 + x1] == 已消除) { z1.X = x1; z1.Y = y; z2.X = x2; z2.Y = y; return true; } } if(Y直连(y1,-1,x1)) { if (Y直连(y2, -1, x2)) { z1.X = x1; z1.Y = -1; z2.X = x2; z2.Y = -1; return true; } } return false; } private bool 下边(int x1, int y1, int x2, int y2)
<< 上一页 [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] ... 下一页 >>