贴吧用户_0aZ32a1 -
关注数: 6 粉丝数: 175 发帖数: 646 关注贴吧数: 8
今天突发奇想,想用程序来算一下老版鱼人骑的最高斩杀,结果…… 今天突发奇想,想用程序来算一下老版鱼人骑的最高斩杀,结果卡在这边了,最大伤害算出来了,但是所对应的各鱼人数量确实错误的……求个大神解答下 package first; import java.util.ArrayList; import java.util.HashMap; import java.util.List; public class FishKnightDamage { private static int LeaderFish; private static int BlindFish; private static int LittleFish; public FishKnightDamage(int LeaderFish,int BlindFish,int LittleFish){ this.LeaderFish = LeaderFish; this.BlindFish = BlindFish; this.LittleFish = LittleFish; } public void print(){ System.out.println("LeaderFish="+LeaderFish); System.out.println("BlindFish="+BlindFish); System.out.println("LittleFish="+LittleFish); } public static void main(String[] args){ HashMap<FishKnightDamage,Integer> damages = new HashMap<>(); for(int LeaderFish=0; LeaderFish<=7; LeaderFish++){ for(int BlindFish=0; BlindFish<=2; BlindFish++){ for(int LittleFish=0; LittleFish<=7; LittleFish++){ if(LeaderFish+BlindFish+LittleFish == 7){ FishKnightDamage fd = new FishKnightDamage(LeaderFish,BlindFish,LittleFish); int damage = BlindFish*(2+6+2*LeaderFish) + LittleFish*(2+2*LeaderFish); damages.put(fd,damage); } } } } //获取最大伤害量 List<Integer> list = new ArrayList<>(); list.addAll(damages.values()); int max = 0; for(int i=0;i<list.size();i++){ if(list.get(i)>max) max = list.get(i); } //通过最大伤害获取相对应的key值 for(FishKnightDamage fd:damages.keySet()){ if(damages.get(fd)==max){ System.out.println("最大伤害值为:"+max); fd.print(); } } } }
1 下一页