- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
各大软件公司经典面试题(国外英语资料)
各大软件公司经典面试题(国外英语资料)
Major software companies classic algorithm interview questions
2011-04-03
Microsoft
1, there is an integer array, request the absolute value of the difference between 22 minimum, remember, as long as the minimum value can be achieved, do not need to find out which two numbers.
2 write a function to check if the character is an integer, and if so, return its integer value. (or: how can you write a function from strings to long lines with only 4 lines of code?)
3 gives a function to output all the permutations of a string.
4 please write the implementation of malloc () memory allocation function, the same code. Give a function to copy two strings, A and B. The last few bytes of the string A overlap the first few bytes of the string B.
5 how to write a program that puts an ordered integer array into a two fork tree?
6 how to print two tree node data at the top layer by layer? Please programming.
7, how to drop a list of orders (that is, reverse order, pay attention to the boundary conditions of the list and consider the empty list)?
8 please write directly to achieve int ATOI (const char * PSTR) function function code.
9 programming two positive integer division, programming two positive integer division, of course, can not use the division operator. View sourceprint / / return x/y. 1?
2 int div (const, int, x, const, int, y)
{3
4...
5}
10 in the sort array, find the number of occurrences of the given number, such as [1, 2, 2, 2, and 2 of the occurrences in 3], 3 times.
11, N points on the plane, each two points are determined by a straight line, the largest slope of the straight line through the two points (the slope is not the case does not consider). The higher the time efficiency, the better.
12 an integer sequence, the element value may be any number in the 0~65535, the same value will not repeat. 0 is an exception that can occur again and again. Please design an algorithm that, when you select 5 values from the sequence, determine whether the
文档评论(0)