第四周作业

alxjerr · web-flow · commit 946194c3cb77 · 2019-05-12T23:18:38.000+08:00
diff --git a/Week_04/id_97/LeetCode_169_097.java b/Week_04/id_97/LeetCode_169_097.java
@@ -0,0 +1,16 @@
+class Solution {
+    public int majorityElement(int[] nums) {
+          Map<Integer,Integer> map = new HashMap<>();
+            for(int num:nums){
+                map.put(num,map.getOrDefault(num,0)+1);
+            }
+            Integer numsD = nums.length/2;
+           // BigDecimal   nums2  = new BigDecimal(numsD);
+            for(Integer key:map.keySet()){
+                if(map.get(key) > numsD ){
+                        return  key;
+                }
+            }
+            return  0;
+    }
+}
diff --git a/Week_04/id_97/LeetCode_746_097.java b/Week_04/id_97/LeetCode_746_097.java
@@ -0,0 +1,12 @@
+class Solution {
+    public int minCostClimbingStairs(int[] cost) {
+         int len = cost.length;
+        int[] dp = new int[len];
+        dp[0] = cost[0];
+        dp[1] = cost[1];
+        for (int i = 2; i < len; i++) {
+          dp[i] = Math.min(dp[i-1],dp[i-2]) + cost[i];
+        }
+        return Math.min(dp[len-1],dp[len-2]); 
+    }
+}
