联盟

GameClient/Assets/Game/HotUpdate/Data/LeagueDataManager.cs

@@ -29,7 +29,7 @@ namespace GFGGame
         public List<LeagueLogData> ListLogDatas = new List<LeagueLogData>();//日志数据
         public LeagueLastAnswerRoleData LastAnswerRoleData = new LeagueLastAnswerRoleData();//上题回答数据
         public Dictionary<long, int> ListAnsweringDatas = new Dictionary<long, int>();//当前答题玩家数据，roleId，答题数量。
-        public Dictionary<int, List<LeagueAnswerData>> ListAnswerRankDatas = new Dictionary<int, List<LeagueAnswerData>>();//答题排行榜数据,int:type//1:周排行 2:上周排行
+        public Dictionary<int, List<LeagueAnswerData>> ListAnswerRankDatas = new Dictionary<int, List<LeagueAnswerData>>();//答题排行榜数据,int:type//0:周排行 1:上周排行
 
 
         public void Clear()

GameClient/Assets/Game/HotUpdate/Views/League/LeagueAnswerRankView.cs

@@ -66,9 +66,8 @@ namespace GFGGame
             _myIndex = -1;
             if (_ui.m_c1.selectedIndex == 1)
             {
-                if (LeagueDataManager.Instance.GetNumeriValue(LeagueNumericType.LeagueQuestionStatus) == LeagueQuestionStatus.End
-                && !LeagueDataManager.Instance.ListAnswerRankDatas.ContainsKey(_ui.m_c1.selectedIndex)
-                || LeagueDataManager.Instance.GetNumeriValue(LeagueNumericType.LeagueQuestionStatus) > LeagueQuestionStatus.End)
+                if (LeagueDataManager.Instance.GetNumeriValue(LeagueNumericType.LeagueQuestionStatus) >= LeagueQuestionStatus.End
+                && !LeagueDataManager.Instance.ListAnswerRankDatas.ContainsKey(_ui.m_c1.selectedIndex))
                 {
                     await LeagueSproxy.ReqGetAnswerRank(_ui.m_c1.selectedIndex);
                 }

GameClient/Assets/Game/HotUpdate/Views/League/LeagueCreatView.cs

@@ -87,7 +87,7 @@ namespace GFGGame
             long needCount = GlobalCfgArray.globalCfg.consumeCreateArr[0][1];
             if (hasCount < needCount)
             {
-                PromptController.Instance.ShowFloatTextPrompt("消耗不足");
+                ItemUtil.BuyCurrency(GlobalCfgArray.globalCfg.consumeCreateArr[0][0], needCount - hasCount);
                 return;
             }