Cary Carter

摘要： 1. self-introduction2. research directions, the source? and can it be applied to reality already?3. what's the difference between the process and the thread4. what is a hash table? (key, value) And how to tackle the colision?5. what is stack overflow?6. what is detruct function?7. what is a fore 阅读全文

摘要： 1. 1>2, 2>4, 5>2.... Here we want get the relationship of all these balls2.two trees here, and they maybe interleave with each other, if so, we need to get the first common node of them 2.1 two strings, how to get the common substring of them. (suffix tree)3.how to distinguish 12 balls with 阅读全文

摘要： 总共四轮面试。1.讲讲论文，然后判断两个字符串有没有包含关系。写测试用例2.一个数组A[0..N]，找出其中的i < j, MAX(A[j] - A[i])。写测试用例3.一个链表，有两个指针域，一个next，一个是rand，next指向后一个，rand指向是任意的。现在复制这个链表。O（N）解决。写测试用例。4.聊聊论文。 阅读全文

摘要： A blog is not a diary.#include <iostream>using namespace std;// the key is to calculate the next array correctlyvoid get_next(char* match, int*next)//calculate the next array just according to the match string{ int len = strlen(match); next[0] = -1;// the initial value of the beginning charact 阅读全文