; z1.Y = y2; return true; } } } if (地图[y1 * 列 + x2] == 已消除)//右下↘ { if (X直连(x1, x2, y1)) { if (Y直连(y1, y2, x2)) { z1.X = x2; z1.Y = y1; return true; } } } } return false; } private bool 右边(int x1, int y1, int x2, int y2)//右边 → { for (int x = x1 + 1; x <= 列; x++) { &nbs
上一页 [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] ... 下一页 >>