Unity递归思想 阶乘 1 1 2 3 5 8 13 和递归寻找子物体

递归的核心思想就是自己调用自己，只要能说出来，就能用代码写出来

public int 阶乘(int index)
    {      

        if (index == 1)
        {
            return 1;
        }
        return index * GeiNum(index - 1);
    }

public int GeiNum(int index)
    {
        if (index == 1 || index == 2)
        {
            return 1;
        }

        return GeiNum(index - 1) + GeiNum(index - 2);

    }

    public Transform FindChildTransForm(Transform parent, string childName)
    {
        if (parent.name == childName)
            return parent;
        if (parent.childCount < 1)
            return null;
        Transform tr = null;
        for (int i = 0; i < parent.childCount; i++)
        {
            tr = FindChildTransForm(parent.GetChild(i), childName);
            if (tr != null)
                break;
        }
        return tr;
    }