基本信息

---

下载

   友情提示：（无需注册或充值，赞助后即可获取资源下载链接）

---

     嘿，亲！知识可是无价之宝呢，但咱这精心整理的资料也耗费了不少心血呀。小小地破费一下，绝对物超所值哦！如有下载和支付问题，请联系我们QQ(微信同号)：813200300

本次赞助数额为： 2 元　

支付宝支付

微信支付

   源码介绍

---

unity3d游戏2d三消游戏果冻花园套装完整项目源码
该资源只能用于学习，不能商用

public class Combine
{
private Item addingItem;
public List<Item> items = new List<Item> ();
public int vCount;
public int hCount;
Vector2 latestItemPositionH = new Vector2 (-1, -1);
Vector2 latestItemPositionV = new Vector2 (-1, -1);
public ItemsTypes nextType;

public Item AddingItem {
get {
return addingItem;
}

set {
addingItem = value;
if (CompareColumns (addingItem)) {
if (latestItemPositionH.y != addingItem.square.row && latestItemPositionH.y > -1)
hCount = 0;
hCount ;
latestItemPositionH = new Vector2 (addingItem.square.col, addingItem.square.row);

} else if (CompareRows (addingItem)) {
if (latestItemPositionV.x != addingItem.square.col && latestItemPositionV.x > -1)
vCount = 0;
vCount ;
latestItemPositionV = new Vector2 (addingItem.square.col, addingItem.square.row);

}
if (hCount > 0 && vCount == 0) {
vCount = 1;
}
items.Add (addingItem);
//Debug.Log(" c: " addingItem.square.col " r: " addingItem.square.row " h: " hCount " v: " vCount " color: " addingItem.color " code: " GetHashCode());
}

}

bool CompareRows (Item item)
{
if (items.Count > 0) {
if (item.square.row > PreviousItem ().square.row)
return true;
} else
return true;

return false;
}

bool CompareColumns (Item item)
{
if (items.Count > 0) {
if (item.square.col > PreviousItem ().square.col)
return true;
} else
return true;

return false;
}


Item PreviousItem ()
{
return items [items.Count - 1];
}
}