# 思路1 dp 三指针法

所有的ugly number：

(1) 1×2, 2×2, 3×2, 4×2, 5×2, … 所有正整数 *2 (2) 1×3, 2×3, 3×3, 4×3, 5×3, … 所有正整数* 3 (3) 1×5, 2×5, 3×5, 4×5, 5×5, … 所有正整数 \* 5 We can find that every subsequence is the ugly-sequence itself (1, 2, 3, 4, 5, …) multiply 2, 3, 5.

我们只要用三个指针，把这些数按照大小顺序排列起来就行了。


---

# 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/0264_ugly_number_ii/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.