> For the complete documentation index, see [llms.txt](https://txfs19260817.gitbook.io/leetcode-go-notes/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://txfs19260817.gitbook.io/leetcode-go-notes/solutions/256.-paint-house.md).

# 256. Paint House

## LeetCode [256. Paint House](https://leetcode-cn.com/problems/paint-house/)

### Description

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]` is the cost of painting house `0` with the color red; `costs[1][2]` is the cost of painting house 1 with color green, and so on...

Return *the minimum cost to paint all houses*.

**Example 1:**

```
Input: costs = [[17,2,17],[16,16,5],[14,3,19]]
Output: 10
Explanation: Paint house 0 into blue, paint house 1 into green, paint house 2 into blue.
Minimum cost: 2 + 5 + 3 = 10.
```

**Example 2:**

```
Input: costs = [[7,6,2]]
Output: 2
```

**Constraints:**

* `costs.length == n`
* `costs[i].length == 3`
* `1 <= n <= 100`
* `1 <= costs[i][j] <= 20`

### Tags

Dynamic Programming

### Solution

Start from the last but one element of `costs`. In terms of the current house `cur = costs[i]`, each element `cur[i] = min(pre[0..i-1, i+1, ...])` where `pre`, initialized with `costs[-1]`, is the last `cur`.

Though we can modify elements in-place, we solve this problem with extra `O(1)` space in case that other functions require this input variable.

### Complexity

* Time complexity: $$O(n)$$, given that there is always 3 colors, we only consider the loop;
* Space complexity: $$O(1)$$, 6 variables.

### Code

```go
func minCost(costs [][]int) int {
	pre := costs[len(costs)-1]
	for i := len(costs) - 2; i >= 0; i-- {
		cur := []int{costs[i][0], costs[i][1], costs[i][2]}
		cur[0] += min(pre[1], pre[2])
		cur[1] += min(pre[0], pre[2])
		cur[2] += min(pre[0], pre[1])
		pre = cur
	}
	return min(min(pre[0], pre[1]), pre[2])
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}
```

## Reference

1. [粉刷房子](https://leetcode-cn.com/problems/paint-house/solution/fen-shua-fang-zi-by-leetcode/)


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://txfs19260817.gitbook.io/leetcode-go-notes/solutions/256.-paint-house.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.