再见小小ronnie的博客

/** * sum is the sum of the array, min is the minimum of the array, f is the final value of the m moves * m is # of moves, n is the size of the array * sum + m(n-1) = f*n (1) * min + m = f

Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. Which means an ugly number is 2^i * 3^j * 5^k * 1 (i,j,k are non-negative integers). Therefore, we can keep dividing the g

An approach is to check every number if it is an ugly number, until we meet the nth ugly number. An efficient way is to construct and enumerate all n ugly number and return the last one. public clas