leetcode/leetcode curated algo 170 (1) 썸네일형 리스트형 [leetcode curated algo 170] 256. Paint house (C++) 256. Paint House There is a row of n houses, where each house can be painted one of three colors: red, blue, or green. The cost of painting each house with a certain color is different. You have to paint all the houses such that no two adjacent houses have the same color. The cost of painting each house with a certain color is represented by an n x 3 cost matrix costs. For example, costs[0][0] i.. 이전 1 다음