华为C++招聘面试题(共3篇).docVIP

华为C++招聘面试题(共3篇) 回目录 题目1：一条小溪上7块石头，如图所示：（图就是下面的链接） #url# 分别有六只青蛙：A，B，C，D，E，F。A，B，C三只蛙想去右岸，它们只会从左向右跳；D，E，F三只蛙想去左岸，它们只会从右向左跳。青蛙每次最多跳到自己前方第2块石头上。请问最少要跳几次所有青蛙上岸。写出步骤。 题目2：Which of the choices below correctly describes the amount of time used by thefollowing code:（下面那个选项正确地描述了代码运行的调度次数） n=10; for(i=1; i lt;n; i++) for(j=1; j lt;n; j+=n/2) for(k=1; k lt;n; k=2*k) x = x +1; A Θ(n) B Θ(n2logn) C Θ(n(log n)2) D Θ(n log n) E Θ((logn)2) 题目3：Give a one-line C expression to test whether a number is a power of?（这句话不知道咋翻译） 题目4：What is wrong with the following code?（下面代码哪错了） char *p; *p = malloc(10); 题目5：Write a c++ function to take two sorted single linked lists as parameters and marge them into one then return it (Please write data structure first)(请写一个C++程序对两个排好序的单链表合成一个大的单链表) S1.1-gt;4-gt;5, S2:2-gt;3-gt;6, result=quot;1-gt;2-gt;3-gt;4-gt;5-gt;6quot; 题目6：Write a function to get the second maximum number in an integer array.（请写程序返回一个数组中第2大的数）int getsecond(int a []) 题目7：Write a c++ program that will delete itself after execution.（写一个程序，该程序执行完后自己删除自己） 题目8：What is the difference between calloc and malloc?（calloc malloc区别是什么？） 题目9：what#39;s wrong with the call fopen(quot;c:\newdir\file datquot;.quot;rquot;)? 题目10：A quad-tree, starting from the root node, could consist of many nodes: leaf-node and non-leaf node. Each non-leaf node may have 1 to 4 child nodes; each node has an internal value V, if not null, which would refer to any node in the same quad-tree. Hierarchically, depth of node describes the distance between a node in a tree and the tree’s root node, the farther the distance is, the deeper the node is at in the tree. The goal is to find all the nodes in the quad-tree which fulfills the condition: the value of node A refers to a node B in the same tree, where the depth of node A is larger than the depth of node B. The input would be a data structure representing the quad-tree; the output would be a data structure representing the list of nodes fulfilling the conditions. （四叉