Transform FindComponent(Transform parent,string name)
{
Stack<Transform> tmpStack = new Stack<Transform>();
tmpStack.Push(parent);
while(tmpStack.Count > 0 )
{
var nextTransform = tmpStack.Pop();
if(nextTransform.name == name)
{
return nextTransform;
}
else
{
//注意这里是倒序push
for(int i = nextTransform.childCount -1 ; i >=0 ; i--)
{
tmpStack.Push(nextTransform.GetChild(i));
}
}
}
if(parent.name == name)
{
return parent;
}
return null;
}
不使用递归算法找结点||组件
最新推荐文章于 2022-12-28 21:05:35 发布