MCPcopy Create free account
hub / github.com/Flamewaker/JavaPersonalSummary / DiDi1

Class DiDi1

Code/exam/DiDi1.java:11–36  ·  view source on GitHub ↗

@author todd @date 2020/7/28 14:42 @description: 寻找丑数 把只包含因子2、3和5的数称作丑数(Ugly Number)。例如6、8都是丑数,但14不是,因为它包含因子7。 习惯上我们把1当做是第一个丑数。求按从小到大的顺序的第N个丑数。

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected