04L型匹配和T型匹配的核心算法

//自己寫的不完全

public List<GameSweet> MatchSweets(GameSweet sweet,int newX,int newY){if (sweet.CanColor()){ColorSweet.ColorType color=sweet.ColoredComponent.Color;List<GameSweet> matchRowSweets=new List<GameSweet>(); //行List<GameSweet> matchLineSweets=new List<GameSweet>(); //豎List<GameSweet> finishedMatchingSweets=new List<GameSweet>(); //完成后的所有匹配//行匹配matchRowSweets.Add(sweet);//i為0 的時候 往左遍歷 為1的時候往右邊遍歷for (int i = 0; i <=1; i++){//往左依次遞減 //往右依次遞加 xDistance偏移量for (int xDistance= 1; xDistance < xColumn; xDistance++){int x; //偏移之后要判斷的位置if (i==0) //左減{x = newX - xDistance; }else //右加{x = newX + xDistance;}//排除邊界值if (x<0||x>=xColumn){break;}//判斷滿足條件if (sweets[x,newY].CanColor()&& sweets[x, newY].ColoredComponent.Color==color){matchRowSweets.Add(sweets[x,newY]);}else{break;}}}//行匹配完畢if (matchRowSweets.Count>=3){//進行L形匹配for (int i = 0; i < matchRowSweets.Count; i++){finishedMatchingSweets.Add(matchRowSweets[i]);}}if (finishedMatchingSweets.Count>=3){return finishedMatchingSweets;}//列匹配matchLineSweets.Add(sweet);//i為0 的時候 往左遍歷 為1的時候往右邊遍歷for (int i = 0; i <= 1; i++){//往左依次遞減 //往右依次遞加 xDistance偏移量for (int yDistance = 1; yDistance < yRow;yDistance++){int y; //偏移之后要判斷的位置if (i == 0) //左減{y = newY - yDistance;}else //右加{y = newY + yDistance;}//排除邊界值if (y < 0 || y >= yRow){break;}//判斷滿足條件if (sweets[newX, y].CanColor() && sweets[newX, y].ColoredComponent.Color == color){matchLineSweets.Add(sweets[newX, y]);}else{break;}}}//行匹配完畢if (matchLineSweets.Count >= 3){for (int i = 0; i < matchLineSweets.Count; i++){finishedMatchingSweets.Add(matchLineSweets[i]);}}if (finishedMatchingSweets.Count >= 3){return finishedMatchingSweets;}}return null;}

//