Skip to content

3502. Minimum Cost to Reach Every Position

  • Time: $O(n)$
  • Space: $O(n)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
class Solution {
 public:
  vector<int> minCosts(vector<int>& cost) {
    vector<int> ans;
    int minCost = INT_MAX;
    for (const int c : cost) {
      minCost = min(minCost, c);
      ans.push_back(minCost);
    }
    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
class Solution {
  public int[] minCosts(int[] cost) {
    int[] ans = new int[cost.length];
    int minCost = Integer.MAX_VALUE;
    for (int i = 0; i < cost.length; ++i) {
      minCost = Math.min(minCost, cost[i]);
      ans[i] = minCost;
    }
    return ans;
  }
}

1
2
3
class Solution:
  def minCosts(self, cost: list[int]) -> list[int]:
    return list(itertools.accumulate(cost, min))