Design an algorithm to find the kth number such that the only prime factors are 3, 5, and 7.
The eligible numbers are like 3, 5, 7, 9, 15 ...
Example
If k=4, return 9.
Challenge
O(n log n) or O(n) time
算法详见:http://www.geeksforgeeks.org/ugly-numbers/
http://www.cppblog.com/zenliang/articles/131094.html
思路总结:
有三个指针p3, p5, p7, 分别对应结果数组中的数字应该乘以3,5,7, 选择三个结果中最小的一个赋予result current指针上的数,并且将p3/p5/p7 指针加一。注意这里不可以使用if/else 循环,因为有可能多于一个指针的结果是相等的:例如p3->5, p5->3, 他们的结果相等,这是两个指针都要+1
public long kthPrimeNumber(int k) {
long[] result = new long[k+1];
int p3 = 0;
int p5 = 0;
int p7 = 0;
result[0] = 1;
for (int i = 1; i <= k; i++) {
long num = Math.min(Math.min(result[p3]*3, result[p5]*5), result[p7]*7);
if (num/result[p3] == 3) {
p3++;
}
if (num/result[p5] == 5) {
p5++;
}
if (num/result[p7] == 7) {
p7++;
}
result[i] = num;
}
return result[k];
}