Paint House II Python Solution with Tests

lcpy gen -n 265   # by problem number
lcpy gen -s paint_house_ii   # by problem name

Input: costs = [[1,5,3],[2,9,4]]
Output: 5
Explanation:
Paint house 0 into color 0, paint house 1 into color 2. Minimum cost: 1 + 4 = 5;
Or paint house 0 into color 2, paint house 1 into color 0. Minimum cost: 3 + 2 = 5.

Input: costs = [[1,3],[2,4]]
Output: 5

class Solution:
    # Time: O(nk)
    # Space: O(k)
    def min_cost_ii(self, costs: list[list[int]]) -> int:
        best = costs[0][:]
        for house in costs[1:]:
            min1 = min(best)
            min1_idx = best.index(min1)
            min2 = min(value for idx, value in enumerate(best) if idx != min1_idx)
            best = [cost + (min2 if idx == min1_idx else min1) for idx, cost in enumerate(house)]
        return min(best)