From 7ad20a2b51e57a12b536f9d3dfc9cdce14b2beaf Mon Sep 17 00:00:00 2001
From: luckypeak <luckypeak>
Date: Sun, 19 May 2019 23:41:19 +0800
Subject: [PATCH] =?UTF-8?q?=E7=AC=AC=E5=9B=9B=E5=91=A8=E6=8F=90=E4=BA=A4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 Week_04/id_124/LeetCode_169_124.java | 34 ++++++++++++++++++++++++++++
 Week_04/id_124/LeetCode_746_124.java | 19 ++++++++++++++++
 2 files changed, 53 insertions(+)
 create mode 100644 Week_04/id_124/LeetCode_169_124.java
 create mode 100644 Week_04/id_124/LeetCode_746_124.java

diff --git a/Week_04/id_124/LeetCode_169_124.java b/Week_04/id_124/LeetCode_169_124.java
new file mode 100644
index 00000000..f5a1e346
--- /dev/null
+++ b/Week_04/id_124/LeetCode_169_124.java
@@ -0,0 +1,34 @@
+import java.util.List;
+
+public class MajorityElement {
+
+    public int majorityElement(int[] nums) {
+        int cnt = 1;
+        int result = nums[0];
+        for (int i = 1;  i < nums.length ; i++){
+            if (nums[i] == result){
+                cnt ++;
+                if (cnt > nums.length /2){
+                    return result;
+                }
+            }else {
+                cnt --;
+            }
+            if (cnt <= 0 ){
+                result = nums[i];
+                cnt = 1;
+            }
+        }
+
+        return result;
+    }
+
+    public List<Integer> majorityElement2(int[] nums) {
+
+        return null;
+    }
+
+    public static void main(String[] args) {
+
+    }
+}
diff --git a/Week_04/id_124/LeetCode_746_124.java b/Week_04/id_124/LeetCode_746_124.java
new file mode 100644
index 00000000..3c49eaf4
--- /dev/null
+++ b/Week_04/id_124/LeetCode_746_124.java
@@ -0,0 +1,19 @@
+public class MinCostClimbingStairs {
+
+    public int minCostClimbingStairs(int[] cost) {
+        if (cost.length == 2) {
+            return Math.min(cost[0], cost[1]);
+        }
+        int[] dp = new int[cost.length + 1];
+        dp[0] = cost[0];
+        dp[1] = cost[1];
+        for (int i = 2; i < cost.length; i++) {
+            dp[i] = Math.min(dp[i - 2], dp[i - 1]) + cost[i];
+        }
+        return Math.min(dp[cost.length - 1], dp[cost.length - 2]);
+    }
+
+
+
+
+}