bsp; private bool 左边(int x1, int y1, int x2, int y2) { for (int x = 0; x < x1; x++) { if (X直连(x1, x, y1) == true && 地图[y1 * 尺寸 + x] == 已消除 && 一折连(x, y1, x2, y2) == true) { z1.X = x; z1.Y = y1; z2.X = x; z2.Y = y2; return true; } } if (X直连(x1, -1, y1)) { if (X直连(x2, -1, y2)) { z1.X = -1; z1.Y = y1; z2.X = -1; z2.Y = y2; return true; } } return false; &n
<< 上一页 [21] [22] [23] [24] [25] [26] [27] [28] [29] [30] ... 下一页 >>