摘要：
class Solution { public double maxProbability(int n, int[][] edges, double[] succProb, int start, int end) { Map<Integer,List<Node>> map = new HashMap 阅读全文
posted @ 2020-07-12 15:29
Sexyomaru
阅读(218)
评论(0)
推荐(0)
摘要：
class Solution { public boolean winnerSquareGame(int n) { boolean[] dp = new boolean[n+1]; // dp[i] 表示有i个石子，alice先手是否可以赢 for(int i = 1; i * i <= n; i+ 阅读全文
posted @ 2020-07-12 14:30
Sexyomaru
阅读(123)
评论(0)
推荐(0)
摘要：
分析：逆向dp class Solution { public int calculateMinimumHP(int[][] dungeon) { if(dungeon.length == 0 || dungeon[0].length == 0) return 0; int m = dungeon. 阅读全文
posted @ 2020-07-12 13:33
Sexyomaru
阅读(171)
评论(0)
推荐(0)
浙公网安备 33010602011771号