diff --git a/solutions/264. Ugly Number II.md b/solutions/264. Ugly Number II.md
index 8e00380..922fa9e 100644
--- a/solutions/264. Ugly Number II.md	
+++ b/solutions/264. Ugly Number II.md	
@@ -1,3 +1,4 @@
+# [264. Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)
 # 思路
 要求第n个ugly数. 由于ugly集合相对于整个int集合是很小的, 所以此题用蛮力法不断判断某个数是否ugly肯定会超时. 所以我们应该从直接构造ugly数着手.