0174. Dungeon Game V1.0

Author: ChlZhYa

LeetCode/0174. Dungeon Game/src/Solution.java

@@ -0,0 +1,30 @@
+/**
+ * @author changleamazing
+ * @date 2020/7/12 11:06
+ * resource: https://leetcode-cn.com/problems/dungeon-game/
+ **/
+public class Solution {
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        int[][] dungeon = {{-2,-3,3},{-5,-10,1},{10,30,-5}};
+        solution.calculateMinimumHP(dungeon);
+    }
+
+    public int calculateMinimumHP(int[][] dungeon) {
+        int[][] dp = new int[dungeon.length][dungeon[0].length];
+        dp[0][0] = dungeon[0][0] > 0 ? 1 : 1 - dungeon[0][0];
+        for (int i = 0; i < dp.length; i++) {
+            for (int j = 0; j < dp[0].length; j++) {
+                if (i == 0 ) {
+                    dp[i][j] = j > 0 ? (dp[i][j - 1]  - (Math.min(dungeon[i][j], 0))) : dp[0][0];
+                } else if (j == 0) {
+                    dp[i][j] =  dp[i - 1][j]  - (Math.min(dungeon[i][j], 0));
+                } else {
+                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]) - (Math.min(dungeon[i][j], 0));
+                }
+            }
+        }
+        return dp[dp.length - 1][dp[0].length - 1];
+    }
+}

LeetCode/0332. Reconstruct Itinerary/src/Solution.java

@@ -0,0 +1,36 @@
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
+
+/**
+ * @author changleamazing
+ * @date 2020/8/27 21:07 source: https://leetcode-cn.com/problems/reconstruct-itinerary/
+ **/
+public class Solution {
+
+    private Map<String, List<String>> graph = new HashMap<>();
+    private List<String> res = new LinkedList<>();
+
+    public List<String> findItinerary(List<List<String>> tickets) {
+        for (List<String> ticket : tickets) {
+            List<String> list = graph.computeIfAbsent(ticket.get(0), K -> new LinkedList<>());
+            list.add(ticket.get(1));
+        }
+
+        graph.values().forEach(x -> x.sort(String::compareTo));
+        dfs("JFK");
+        return res;
+    }
+
+    private void dfs(String fromCode) {
+        List<String> toCodes = graph.get(fromCode);
+        while (toCodes != null && toCodes.size() != 0) {
+            dfs(toCodes.remove(0));
+        }
+        res.add(0, fromCode);
+    }
+}