常见算法笔试或面试题（Common algorithms written or interview questions）.docVIP

下载本文档

9
0
约1.5万字
约 22页
2017-10-07 发布于河南
举报
版权申诉

常见算法笔试或面试题（Common algorithms written or interview questions）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

常见算法笔试或面试题（Common algorithms written or interview questions）

常见算法笔试或面试题（Common algorithms written or interview questions） Zhenjings tech blog Form a literary circle Common algorithms written or interview questions 2010-10-18 10:12 by Zhenjing, 4714 visits, fanchon, collection, editing Problem 1: Is, it, a, loop? Assume that wehave a head pointer to a link-list. Also assumethat we know the list is single-linked. Can you come up an algorithm to checkwhether this link list includes a loop by using O (n) time and O (1) space wheren is the length of the list Furthermore can you do? So with O (n) time and onlyone register? Methods: use two pointers, start from scratch, move one node at a time, one forward, 2 nodes, at most 2N, and then two pointers can overlap, and if no ring, then normal stop. Similarly, you can find the middle node of the list. Ditto。 Problem 2: design a complex n algorithm to find the last m elements of the list. The last element assumes the last zeroth. Tip: double pointer lookup Problem 3: the simplest way to determine the number of LONG shaping is 2^n (As n order 2) Tip: x (x-1) Problem 4: two beaker, one sugar, one salt, spoon a spoonful of sugar to salt, stir well, then scoop a spoonful of mixture will sugar beaker, ask you two beaker which impurities? Hint: same. If the impurities are different, then put the impurity back into the original cup, then the weight of the object in the cup will change, which is not reasonable. Problem 5: give you a, B two files, each store 5 billion URL, each URL occupy 64 bytes each, memory limit is 4G, let you find a, B file common url. Rule 1: use the hash table. Using a elements to create hash tables, hash is controlled on an appropriate scale. Find the elements of B in hash, the URL that cannot be found first exists in the new file, and next search. If found, the corresponding hash table entry is deleted and the new element in the A is re - hash when the hash table entry is less than a threshold. Re cycle. Rule 2: a file that adds a record to the hash table entry, a, B. As