Intuitive Javascript Solution


  • 0
    D

    Javascript Implementation of @yao9208 's Java solution

    var minCost = function(costs) {
        if (!costs.length) return 0;
        
        let n = costs.length;
    
        // going through the houses and record the minimum total cost for each color
        for (let i = 1; i < n; i++) {
            costs[i][0] += Math.min(costs[i-1][1], costs[i-1][2]);
            costs[i][1] += Math.min(costs[i-1][0], costs[i-1][2]);
            costs[i][2] += Math.min(costs[i-1][0], costs[i-1][1]);
        }
    
        return Math.min(costs[n-1][0], costs[n-1][1], costs[n-1][2]);
    };
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.