Min Cost Climbing Stairs Solutions in PythonNumber 746Difficulty EasyAcceptance 50.4%Link LeetCodeOther languages C++, GoSolutionsPython solution by haoel/leetcodedef minCostClimbingStairs(self, cost): temp = [0, cost[0]] for i in range(1, len(cost)): temp[0], temp[1] = temp[1], min(temp) + cost[i] return min(temp)def minCostClimbingStairs(self, cost): temp = [0, cost[0]] for i in range(1, len(cost)): temp[0], temp[1] = temp[1], min(temp) + cost[i] return min(temp)