zoukankan      html  css  js  c++  java
  • 列表遍历运用

    List<Transform> MainMenuBtn = new List<Transform>();

    //遍历所有按钮,并重置按钮状态
    private void RestButtonInteractive(Transform btn)
    {
      foreach (Transform kk in MainMenuBtn)
      {
        if (kk == btn)
        {
          kk.GetComponent<Button>().interactable = false;
        }
        else
        {
          kk.GetComponent<Button>().interactable = true;
        }
      }
    }
    //查找遍历所有按钮,并添加到列表中
    private void StroeMainMenuBtnData()
    {
      var btn = mainLogo.transform.FindChild("back/menuPanel");
      foreach (Transform kk in btn.transform)
      {
        if (kk.GetComponent<Button>() != null)
        {
          MainMenuBtn.Add(kk);
        }
      }
    }

  • 相关阅读:
    DDPG
    Actor Critic
    Policy Gradients
    DQN
    Sarsa
    粘滞键
    Codeforces Round #236 (Div. 2) E. Strictly Positive Matrix 强连通
    hdu 1853 Cyclic Tour KM
    hdu 3435 A new Graph Game KM
    hdu 3488 Tour KM
  • 原文地址:https://www.cnblogs.com/Study088/p/7219249.html
Copyright © 2011-2022 走看看