# 思路1 DP

同264，只是235换成了一个未定的list

dp\[i] 表示第 i 个超级丑数。最小的超级丑数是1，有 dp\[1] = 1

创建与数组 primes 长度相同的数组 pointers, 每个元素初始化为 1

当 2 <= i <= n 时，dp\[i] = min(dp\[pointers\[j]] \* primes\[j]) (for j in range(len(primes)))

然后再把用到的那个指针 += 1


---

# Agent Instructions: 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://851958789.gitbook.io/notes/0313_super_ugly_number/slt.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.