ziyang_li/LeetCode
1
0
Fork 0
mirror of https://github.com/ShusenTang/LeetCode.git synced 2026-09-03 22:38:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

add title

Browse Source
This commit is contained in:
ShusenTang
2019-11-14 20:13:14 +08:00
committed by GitHub
parent a6e8385fd5
commit d81cc96c18
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
solutions/264. Ugly Number II.md
+1
View File
@@ -1,3 +1,4 @@
# [264. Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)
# 思路 # 思路
要求第n个ugly数. 由于ugly集合相对于整个int集合是很小的, 所以此题用蛮力法不断判断某个数是否ugly肯定会超时. 所以我们应该从直接构造ugly数着手. 要求第n个ugly数. 由于ugly集合相对于整个int集合是很小的, 所以此题用蛮力法不断判断某个数是否ugly肯定会超时. 所以我们应该从直接构造ugly数着手.