746. Min Cost Climbing Stairs
1. Question: 746.?Min Cost Climbing Stairs https://leetcode.com/problems/min-cost-climbing-stairs/ On a staircase,the? Once you pay the cost,you can either climb one or two steps. You need to find minimum cost to reach the top of the floor,and you can either start from the step with index 0,or the step with index 1. Example 1: Input: cost = [10,15,20] Output: 15 Explanation: Cheapest is start on cost[1],pay that cost and go to the top. ? Example 2: Input: cost = [1,100,1,1] Output: 6 Explanation: Cheapest is start on cost[0],and only step on 1s,skipping cost[3]. class Solution: def minCostClimbingStairs(self,cost): """ :type cost: List[int] :rtype: int """ if cost is None or len(cost) <= 1: return 0 size = len(cost) if size == 2: return min(cost[0],cost[1]) cost_bf = cost[0] cost_cur = cost[1] for i in range(2,size): tmp = min(cost_cur + cost[i],cost_bf + cost[i]) cost_bf = cost_cur cost_cur = tmp return min(cost_cur,cost_bf) 3. Complexity Analysis Time?Complexity : O(N) Space?Complexity: O(1) (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |