题目:
代码:(三指针法)
class Solution {
public:
int getKthMagicNumber(int k) {
if(k==1) return 1;
int ans[k];
ans[0]=1;
int three=0,five=0,seven=0;
int a,b,c;
for(int i=1;i<k;i++){
a=ans[three]*3;
b=ans[five]*5;
c=ans[seven]*7;
ans[i]=min(min(a,b),c);
if(a==ans[i]) three++;
if(b==ans[i]) five++;
if(c==ans[i]) seven++;
}
return ans[k-1];
}
};