byr上看到的百度面试题

 

北邮人上看到的，职位搜索研发：

一面：

 

1、strncpy(char* dst, char * src, int n)的实现

2、两个有序数组求交集

3、N个数里面查找是否存在和为m的两个数

4、蚂蚁爬杆

5、100层楼，球可能会在某一层楼摔坏，问用2个球，最坏情况下几次测试可以找出该楼层

 

二面

1、数据流(不知道规模)，随机抽取N个样本

2、百度现在收录了X亿中文网页，叫你估算网页总的数量

 

 

 

---

 

解答：

1。这个先要弄清strncpy的含义，很简单Linux下man一下就知道了，man手册还给出了实现

 

       The strncpy() function is similar, except that at most n bytes  of  src

       are  copied.  Warning: If there is no null byte among the first n bytes

       of src, the string placed in dest will not be null-terminated.

 

       If the length of src is less than n, strncpy() pads  the  remainder  of

       dest with null bytes.

注意Warning部分及第二段说明

A simple implementation of strncpy() might be:

char* strncpy(char *dest, const char *src, size_t n){ size_t i; for (i = 0 ; i < n && src[i] != '/0' ; i++) dest[i] = src[i]; for ( ; i < n ; i++) dest[i] = '/0'; return dest; }  

 

2。没什么技术含量，直接上代码

/* * two sorted arrays, find the intersection of them */ #include <stdio.h> #include <time.h> #include <stdlib.h> #include <string.h> #define N1 10 #define N2 20 #define MAX 10 #define DEBUG static int i_compare(const void *i, const void *j) { return *(const int *)i - *(const int *)j; } int main() { int A[N1]; int B[N2]; const int N = (N1 < N2) ? N1 : N2; int C[N]; int i, j, k; srandom((unsigned int)time(NULL)); #if 1 for (i = 0; i < N1; i++){ A[i] = random() % MAX; } for (i = 0; i < N2; i++){ B[i] = random() % MAX; } qsort(A, N1, sizeof(A[0]), i_compare); qsort(B, N2, sizeof(B[0]), i_compare); #endif #ifdef DEBUG for (i = 0; i < N1; i++){ printf("%4d", A[i]); } printf("/n"); for (i = 0; i < N2; i++){ printf("%4d", B[i]); } printf("/n"); #endif i = 0; j = 0; k = 0; while (i < N1 && j < N2){ if (A[i] < B[j]){ i++; }else if (A[i] == B[j]){ if (k > 0){ if (A[i] != C[k - 1]){ C[k++] = A[i]; } }else{ C[k++] = A[i]; } i++; j++; }else{ j++; } } printf("intersection(%d):/n", k); for (i = 0; i < k; i++){ printf("%4d", C[i]); } printf("/n"); return 0; }