174 350

Author: LuYanFCP

README.md

@@ -28,6 +28,7 @@ Leetcode刷题记录
 
 + No.1 [cpp](cpp/1.cpp) [python](python/1.py)
 + No.3 [cpp](cpp/3.cpp)
++ No.350 [cpp](cpp/350.cpp) [python](python/350.py)
 
 ### 双指针
 
@@ -68,7 +69,7 @@ Leetcode刷题记录
 + No.837 [cpp](cpp/837.cpp) [python](python/837.py)
 + No.126 [cpp](cpp/126.cpp) [python](python/126.py)
 + No.1014 [cpp](cpp/1014.cpp) [python](python/1014.py) easy
-+ No.174  [java](java/Problem174.java)
++ No.174  [cpp](cpp/174.cpp) [python](python/174.py) [java](java/Problem174.java) 
 
 #### 状态机DP
 

cpp/174.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution {
+public:
+    int calculateMinimumHP(vector<vector<int>>& dungeon) {
+        int m = dungeon.size(), n = dungeon[0].size();
+        // 为了少写一个判断，增加一行一列
+        vector<vector<int>> dp(m+1, vector<int>(n+1, 100000));
+        dp[m][n-1] = dp[m-1][n] = 1; // 不能死
+        for (int i = m-1; i >= 0; --i) {
+            for (int j = n-1; j >= 0; --j) {
+                // 找到最少的路
+                int min_pre = min(dp[i+1][j], dp[i][j+1]);
+                dp[i][j] = max(min_pre - dungeon[i][j], 1); //如果小于零证明血量够后面用了，改为0通过前面的路即可
+            }
+        }
+        return dp[0][0];
+    }
+};

cpp/350.cpp

@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution {
+public:
+    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
+        unordered_map<int, int> hashmap;
+        // unordered_set<int> set;
+        vector<int> res;
+        for (int num1: nums1) ++hashmap[num1];
+        for (int num2: nums2)
+            if (hashmap.find(num2) != hashmap.end()) 
+                if (hashmap[num2]) {
+                    res.push_back(num2);
+                    --hashmap[num2];
+                }
+        return res;
+    }
+};

python/174.py

@@ -0,0 +1,12 @@
+class Solution:
+    def calculateMinimumHP(self, dungeon: List[List[int]]) -> int:
+        m, n = len(dungeon), len(dungeon[0])
+        dp = [[100000] * (n + 1) for _ in range(m + 1)]
+        dp[n][m - 1] = dp[n - 1][m] = 1
+
+        for i in range(m - 1, -1, -1):  
+            for j in range(n - 1, -1, -1):
+                minn = min(dp[i + 1][j], dp[i][j + 1])
+                dp[i][j] = max(minn - dungeon[i][j], 1) 
+
+        return dp[0][0]

python/350.py

@@ -0,0 +1,13 @@
+from collections import Counter
+class Solution:
+    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        hashtable = Counter()
+        result = []
+        for num1 in nums1:
+            hashtable[num1] += 1
+        for num2 in nums2:
+            if num2 in hashtable:
+                if hashtable[num2]:
+                    result.append(num2)
+                    hashtable[num2] -= 1
+        return result