1.8 找到只含3,5,7因子的第k大的数

最新推荐文章于 2024-08-10 21:33:21 发布

原创最新推荐文章于 2024-08-10 21:33:21 发布 · 941 阅读

0 ·

CC 4.0 BY-SA版权

cc150笔记专栏收录该内容

10 篇文章

订阅专栏

本文探讨了一道复杂算法题：找到仅由3、5和7这三个质数作为因数的第K个数。文章首先介绍了暴力解决方法，并提示读者思考如何优化这一过程或发现这些数字背后的模式。

1.8 Design an algorithm to find the kth number such that the only prime factors are 3, 5, and 7.

能想到的就是暴力一下了。。。

貌似还有更好的办法

This is a hard problem. Don’t feel bad if you weren’t able to solve this. Does that mean it’s
too hard to be solved in an interview? Not exactly. After all, this question is here because
someone else was asked it!
When you get this question, do your best to solve it—even though it’s really difficult. Explain
a brute force approach (not as tricky) and then start thinking about how you can optimize it.
Or, try to find a pattern in the numbers.
Chances are, your interviewer will help you along when you get stuck. Whatever you do,
don’t give up! Think out loud, wonder aloud, explain your thought process. Your interviewer
will probably jump into guide you.