网易有道笔试、面试【hao】

1. 最短前缀

 

问题描述：输出字符串的最短前缀匹配

例如：abc  abad  bc

最短前缀就为：abc  aba  b

Trie树的典型应用

#include <iostream> #include <fstream> #include <cstring> #include <cstdlib> using namespace std; struct Node{ char word; int count; struct Node *child[26]; Node() { count = 0; for(int i=0; i<26; i++) child[i] = NULL; } }; /** * insert into trie tree */ void insert(Node *root, char *in) { int len = strlen(in); Node *ptr = root; for(int i=0; i<len; i++){ int index = in[i] - 'a'; if(NULL == ptr->child[index]){ ptr->child[index] = new Node(); } ptr = ptr->child[index]; ptr->count++; } } /** * If the node's count equals 1, it's the minimum suffix */ void find(Node *root, char *in, char *out) { int len = strlen(in); Node *ptr = root; int i = 0; for(; i<len; i++){ int index = in[i] - 'a'; ptr = ptr->child[index]; if(1 == ptr->count) break; } int j = 0; for(; j<=i; j++) out[j] = in[j]; out[j] = '/0'; } void destory(Node *root) { for(int i=0; i<26; i++){ if(NULL != root) destory(root->child[i]); } delete root; } void prefix(char *filename) { ifstream cin(filename); char word_in[1024][30]; char word_out[1024][30]; Node *root = new Node(); int i = 0; while(cin>>word_in[i]){ insert(root, word_in[i]); i++; } /* move to the begin of the file */ cin.seekg(0); for(int j=0; j<i; j++){ find(root, word_in[j], word_out[j]); cout<<word_in[j]<<" "<<word_out[j]<<endl; } } int main(int argc, char **argv) { if(argc < 2) exit(-1); prefix(argv[1]); return 0; }  

 

2. 最大子矩阵和(DP)

#include <iostream> #include <cstring> using namespace std; /** * array[n][m] */ int max_array_sum(int **array, int n, int m) { int max_sum = 0; for(int i=0; i<n; i++){ int line_sum[m]; for(int j=0; j<m; j++) line_sum[j] = 0; for(int j=i; j<n; j++){ for(int k=0; k<m; k++) line_sum[k] += array[j][k]; int cur_sum = 0; for(int k=0; k<m; k++){ cur_sum += line_sum[k]; if(cur_sum < 0) cur_sum = 0; if(cur_sum > max_sum){ max_sum = cur_sum; } } } } return max_sum; } int main() { int a1[3] = {0,1,2}; int a2[3] = {-2,-1,5}; int *a[2] = {a1, a2}; cout<<max_array_sum(a, 2, 3)<<endl; return 0; }  

 

3. 给定数组a[n]， 任意两个元素做差，求最大差值

#include <iostream> using namespace std; int a[] = {1,2,3,4,5,99,-98,100}; /** * find max and min element */ int max_delta_1() { int max = a[0]; int min = a[0]; for(int i=0; i<sizeof(a)/sizeof(int); i++){ if(a[i] < min) min = a[i]; if(a[i] > max) max = a[i]; } return max-min; } int max_array(int *a, int n) { int max_sum = 0; int cur_sum = 0; for(int i=0; i<n; i++){ cur_sum += a[i]; if(cur_sum < 0) cur_sum = 0; if(max_sum <cur_sum) max_sum = cur_sum; } return max_sum; } /** * transform a0,a1,a2...an to * a0-a1, a1-a2, a2-a3... and reverse * find max sum of array */ int max_delta_2() { int len = sizeof(a)/sizeof(int); int b1[len-1]; int b2[len-1]; for(int i=0; i<len-1; i++){ b1[i] = a[i] - a[i+1]; b2[i] = -b1[i]; } int sum1 = max_array(b1, len-1); int sum2 = max_array(b2, len-1); return sum1>sum2?sum1:sum2; } int main() { cout<<max_delta_1()<<endl; cout<<max_delta_2()<<endl; return 0; }

 

4. 木棍上随机放置若干个蚂蚁，方向不确定，如果蚂蚁碰面则各自往回爬，求最后一只蚂蚁爬离木棍的时间？

答案：离端点最远的那只蚂蚁爬出的时间为总时间。

 

 

5. 路标问题，判断是否为合法路标

 

问题描述：给定一个数组a[n]，里面的每一个元素为一个路标，判定是否为一组合法路标（路标可能被风吹的反向），给定总距离

 

例如：从上海到北京全长为11，放置路标a[n]数组为{ 1  3  6  2   10 }

上述为合法数组，因为把2反向的话就为{1 3 6 9 10}，满足递增序

 

思路：从a[0]开始，调整后面的元素，使序列递增，且使增量最小，如果整个序列都可以满足该条件，则是合法路标。

#include <iostream> using namespace std; /* guidepost array */ const int a[] = {1, 7, 5, 9, 4, 1}; /* total length */ const int L = 10; inline int min(int a, int b) { return a<b?a:b; } inline int max(int a, int b) { return a>b?a:b; } bool is_valid_guidepost() { /* adjust array with minimal increment. * If sorted, then we judge them as valid guideposts */ int num = sizeof(a)/sizeof(int); int b[num]; /* sort ascending */ b[0] = min(a[0], L-a[0]); for(int i=1; i<num; i++){ b[i] = min(a[i], L-a[i]); if(b[i]<=b[i-1]){ b[i] = L-b[i]; if(b[i]<=b[i-1]) return false; } } return true; } int main() { cout<<is_valid_guidepost()<<endl; return 0; }

 

6. 大数相加，可能为浮点数

#include <iostream> #include <cstring> #include <cstdlib> using namespace std; /** * @param in: float string * @param out: string without decimal point * @return length of decimal */ int remove_decimal_point(char *in, char *out) { int len = strlen(in); int len_decimal = len; for(int i=0; i<len; i++){ --len_decimal; if('.' == in[i]) break; } int len_int = len - len_decimal; /* has decimal point */ if(len_decimal) len_int--; strncpy(out, in, len_int); strncpy(out+len_int, in+len_int+1, len_decimal); return len_decimal; } inline bool is_valid(char *a) { if(a[0] < '0' || a[0] > '9') return false; int len = strlen(a); int num = 0; for(int i=1; i<len-1; i++){ if(a[i]<'0' || a[0] > '9'){ if(a[i] == '.'){ ++num; if(num > 1) return false; } else return false; } } if(a[len-1] < '0' || a[len-1] > '9') return false; return true; } int add(char *a, char *b, char *c) { /* invalid check */ if( !a || !b || !c) exit(-1); if(!is_valid(a) || !is_valid(b)) exit(-1); /* temporary buffer * remove decimal point if any */ char tmp_a[1024] = {'/0'}; char tmp_b[1024] = {'/0'}; char tmp_c[1024] = {'/0'}; int len_a_decimal = remove_decimal_point(a, tmp_a); int len_b_decimal = remove_decimal_point(b, tmp_b); int len_c_decimal = 0; /* add '0' */ if(len_a_decimal > len_b_decimal){ len_c_decimal = len_a_decimal; memset(tmp_b + strlen(tmp_b), '0', len_a_decimal - len_b_decimal); } else{ len_c_decimal = len_b_decimal; memset(tmp_a + strlen(tmp_a), '0', len_b_decimal - len_a_decimal); } cout<<"tmp_a:"<<tmp_a<<'/t'<<len_a_decimal<<endl; cout<<"tmp_b:"<<tmp_b<<'/t'<<len_b_decimal<<endl; /* big int */ int carry = 0; int len_tmp_a = strlen(tmp_a); int len_tmp_b = strlen(tmp_b); /* actually lenth of tmp_c[] is (len_tmp_c + 1)*/ int len_tmp_c = len_tmp_a>len_tmp_b ? len_tmp_a : len_tmp_b; for(int i=0; i<len_tmp_c; i++){ int m = 0; int n = 0; if(i<len_tmp_a) m = tmp_a[len_tmp_a-1-i] - '0'; if(i<len_tmp_b) n = tmp_b[len_tmp_b-1-i] - '0'; int k = (m + n + carry)%10; carry = (m + n + carry)/10; tmp_c[len_tmp_c - i] = k + '0'; } tmp_c[0] = carry + '0'; cout<<"tmp_c:"<<tmp_c<<endl; /* format tmp_c[] */ int len_c_int = len_tmp_c + 1 - len_c_decimal; if('0' == tmp_c[0]){ strncpy(c, tmp_c+1, len_c_int-1); if(len_c_decimal){ c[len_c_int-1] = '.'; strncpy(c+len_c_int, tmp_c+len_c_int, len_c_decimal); } } else{ strncpy(c, tmp_c, len_c_int); if(len_c_decimal){ c[len_c_int] = '.'; strncpy(c+len_c_int+1, tmp_c+len_c_int, len_c_decimal); } } } int main(int argc, char **argv) { if(argc < 3) exit(-1); char result[1024] = {'/0'}; add(argv[1],argv[2],result); cout<<result<<endl; return 0; }  

 

7. 二维数组排序，数组很大，size[i]表示i行有多少列，len表示有多少行

 

void sort(int **array, int *size, int len) //二维数组排序

#include <iostream> #include <cstdlib> #define MAX_INT 0x7fffffff using namespace std; bool is_all_null(int **ptrs, int len) { for(int i=0; i<len; i++){ if(ptrs[i] != NULL) return false; } return true; } int get_min(int **ptrs, int len) { int min_index = 0; for(int i=0; i<len; i++){ if(ptrs[i] && *ptrs[i] < *ptrs[min_index]){ min_index = i; } } return min_index; } void quick_sort(int *a, int low, int high) { if(low < high){ int left = low; int right = high; int pivot = a[left]; while(left < right){ while(left < right && a[right] >= pivot) --right; a[left] = a[right]; while(left < right && a[left] <= pivot) ++left; a[right] = a[left]; } a[left] = pivot; /* recursion */ quick_sort(a, low, left-1); quick_sort(a, left+1, high); } } void print_array(int **a, int *size, int len) { for(int i=0; i<len; i++){ cout<<"-----------------"<<endl; for(int j=0; j<size[i]; j++) cout<<a[i][j]<<'/t'; cout<<endl; } } void sort(int **a, int *size, int len) { /* sort each row */ for(int i=0; i<len; i++) quick_sort(a[i], 0, size[i]-1); /* ptrs point to array's first element */ int *ptrs[len]; for(int i=0; i<len; i++) ptrs[i] = &(a[i][0]); // print_array(a, size, len); /* move ptr */ while(!is_all_null(ptrs, len)){ int x = get_min(ptrs, len); cout<<*(ptrs[x])<<endl; if(ptrs[x] == &a[x][size[x]-1]){ ptrs[x] = NULL; } else ptrs[x]++; } } int main() { int a1[] = {1000,232,3,4,5,6,22,4,1,14,123123,45,2}; int a2[] = {444,213,4521,333,124,145,123,51}; int a3[] = {444,23,4521,333,14,145,123,51}; int *a[3] = {a1, a2, a3}; int size[] = {sizeof(a1)/sizeof(int), sizeof(a2)/sizeof(int), sizeof(a3)/sizeof(int)}; int len = 3; sort(a, size, len); return 0; }  

 

8. a[n]代表n个木桶里面的球数，如何使桶中的球变均衡（尽量均衡，球数相差最多为1个），并且移动次数最少

 

思路：排序，求得平均值，后面的桶（球数多）向前面的桶移动球...如果平均值不是整数，移动球数需要更精确控制。