根据品质、等级进行排序,并把寻宝放在最后面;
品质quality、等级Level、寻宝DoTreasure
List<LegendCardData> legendCardDataList = new List<LegendCardData>();
legendCardDataList.Sort(SortByIdTreasureHunt);
int SortByIdTreasureHunt(LegendCardData data1, LegendCardData data2)
{
ConfigArmyHeroInfo heroInfo1 = ConfigManager.inst.DB_ArmyHero.Get(data1.LegendId);
ConfigArmyHeroInfo heroInfo2 = ConfigManager.inst.DB_ArmyHero.Get(data2.LegendId);
if (data2.DoTreasure.CompareTo(data1.DoTreasure) != 0)
{
return data1.DoTreasure.CompareTo(data2.DoTreasure);
}
if (heroInfo1 != null && heroInfo2 != null)
{
if (heroInfo2.quality.CompareTo(heroInfo1.quality) != 0)
{
return heroInfo2.quality.CompareTo(heroInfo1.quality);
}
else if (data2.Level.CompareTo(data1.Level) != 0)
{
return data2.Level.CompareTo(data1.Level);
}
else
{
return heroInfo2.internalId.CompareTo(heroInfo1.internalId);
}
}
return 1;
}
本文深入探讨了一种用于游戏卡牌数据排序的算法,该算法根据卡牌的品质、等级及是否参与寻宝活动进行排序,确保了游戏内卡牌展示的合理性和玩家体验的优化。
5863

被折叠的 条评论
为什么被折叠?



