feat: add python and java solutions to leetcode problem: No.0746

Author: yanglbme

solution/0700-0799/0746.Min Cost Climbing Stairs/README.md

@@ -45,15 +45,32 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minCostClimbingStairs(self, cost: List[int]) -> int:
+        pre = cur = 0
+        n = len(cost)
+        for i in range(1, n):
+            t = min(cost[i] + cur, cost[i - 1] + pre)
+            pre, cur = cur, t
+        return cur
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int minCostClimbingStairs(int[] cost) {
+        int pre = 0, cur = 0;
+        for (int i = 1, n = cost.length; i < n; ++i) {
+            int t = Math.min(cost[i] + cur, cost[i - 1] + pre);
+            pre = cur;
+            cur = t;
+        }
+        return cur;
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0746.Min Cost Climbing Stairs/README_EN.md

@@ -61,13 +61,30 @@ Once you pay the cost, you can either climb one or two steps. You need to find m
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minCostClimbingStairs(self, cost: List[int]) -> int:
+        pre = cur = 0
+        n = len(cost)
+        for i in range(1, n):
+            t = min(cost[i] + cur, cost[i - 1] + pre)
+            pre, cur = cur, t
+        return cur
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int minCostClimbingStairs(int[] cost) {
+        int pre = 0, cur = 0;
+        for (int i = 1, n = cost.length; i < n; ++i) {
+            int t = Math.min(cost[i] + cur, cost[i - 1] + pre);
+            pre = cur;
+            cur = t;
+        }
+        return cur;
+    }
+}
 ```
 
 ### **...**

solution/0700-0799/0746.Min Cost Climbing Stairs/Solution.java

@@ -1,12 +1,11 @@
 class Solution {
     public int minCostClimbingStairs(int[] cost) {
-        int pre1 = 0, pre2 = 0;
-        int res = 0;
-        for (int i = 2; i <= cost.length; ++i) {
-            res = Math.min(pre1 + cost[i - 1], pre2 + cost[i - 2]);
-            pre2 = pre1;
-            pre1 = res;
+        int pre = 0, cur = 0;
+        for (int i = 1, n = cost.length; i < n; ++i) {
+            int t = Math.min(cost[i] + cur, cost[i - 1] + pre);
+            pre = cur;
+            cur = t;
         }
-        return res;
+        return cur;
     }
-}
+}

solution/0700-0799/0746.Min Cost Climbing Stairs/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def minCostClimbingStairs(self, cost: List[int]) -> int:
+        pre = cur = 0
+        n = len(cost)
+        for i in range(1, n):
+            t = min(cost[i] + cur, cost[i - 1] + pre)
+            pre, cur = cur, t
+        return cur