shengzhc
BAN USERvoid intersection(vector<int> list1, vector<int> list2) {
map<int, int> hashTable;
map<int, int>::iterator it;
for (int i=0; i<list1.size(); i++) {
it = hashTable.find(list1[i]);
if (it == hashTable.end()) hashTable.insert(pair<int, int>(list1[i], 1));
else it>second++;
}
for (int i=0; i<list2.size(); i++) {
it = hashTable.find(list2[i]);
if (it != hashTable.end() && it>second != 0) {
it>second;
std::cout<<list2[i]<<endl;
}
}
}

shengzhc
March 13, 2013 using hash table to store the query body and occurrence, it can be done in O(n) time. And then keep a min heap of 10 capacity to find the top 10. If the new one is bigger than the top of our min heap, it can replace the min heap top and keep the min heap property in O(log10). The total time would be O(n+n*log10), at most O(n)
 shengzhc March 10, 2013The condition in this problem is not enough. If the walking ways are limited to right and down, it can be achieved by DP, where M[i][j] = M[i+1][j] + M[i][j+1]. However, if it is allowed to walk in all direction, it would be solved by DFS with a visited history of all points, which is analog to a brutal force algorithm.
 shengzhc March 10, 2013string longestCommonSubsequence(string s1, string s2) {
multimap<char, string> suffixTree;
int longest = 0;
string lstr = “”:
for (int i=0; i<s1.length(); i++) {
suffixTree.insert(pair<char, string>(s1[i], s1.substr(i)));
}
multimap<char, string>::iterator it;
for (int i=0; i<s2.length(); i++) {
it = suffixTree.find(s2[i]);
if (it == suffixTree.end()) continue;
pair<multimap<char, string>::iterator, multimap<char, string>::iterator> range = suffixTree.equal_range(s2[i]));
for (it = range.first; it != range.second; it++) {
int p=0, q=i;
while(p<it>second.length() && q<s2.length()) {
if (it>second[p] != s2[q]) break;
p++; q++;
}
if (longest < p) { longest = p; lstr = it>second.substr(0, p);}
}
}
return lstr;
}
Once I got this done, I found that it was possible to get using dynamic programming with the following formula.
M[i, j] = max(M[i1, j1], M[i+1, j], M[i, j+1]) if (S1[i] == S2[j])
= max(M[i+1, j], M[i, j+1]) if (S1[i] != S2[j])
M[i, j] refers to the ith position of S1 and jth position of S2

shengzhc
March 09, 2013 void subsequence(const int *list, int size) {
if (size == 0  size == 1)
return;
int *M = new int[size];
int *Post = new int[size];
for (int i=0; i<size; i++) {
M[i] = 1;
Post[i] = 1;
}
M[size1] = 1;
Post[size1] = 1;
int front = 0;
int longest = 0;
for (int i=size2; i>=0; i) {
int max = 0;
for (int j=i+1; j<size; j++) {
if (list[j] >= list[i] && max < M[j]+1) {
max = M[j]+1;
Post[i] = j;
if (longest < max) {
longest = max;
front = i;
}
}
}
}
while(front != 1) {
cout <<list[front]<<endl;
front = Post[front];
}
delete M;
delete F;
}

shengzhc
March 09, 2013 void sortString(string &word, const string &dictionary) {
map<char, int> m;
for (int i=0; i<word.size(); i++) {
map<char, int>::iterator it = map.find(word[i]);
if (it == map.end()) word.insert(pair<char, int>(word[i], 1));
else it>second += 1;
}
int k = 0;
for (int i=0;i<dictionary.size()) {
map<char, int>::iterator it = map.find(dictionary[i]);
if (it != map.end()) {
word.replace(word.begin()+k, it>second, dictionary[i]);
k += it>second;
}
}
return;
}

shengzhc
March 09, 2013 int GetMutualMedian(int *A, int *B, int n, int m, int pos) {
if (n == 1) return B[pos];
if (m == 1) return A[pos];
int amid = pos/2 > n ? n : pos/2;
int bmid = pos/2 > m ? m : pos/2;
if (A[amid] > B[bmid]) {
if (bmid == m) return GetMutualMedian(A, B, n, 1, posbmid);
else return GetMutualMedian(A, B+bmid, amid, mbmid, pos/2);
}
else if (A[amid] < B[bmid]) {
if (amid == n) return GetMutualMedian(A, B, 1, m, posamid);
else return GetMutualMedian(A+amid, B, namid, bmid, pos/2);
}
else {
if (n >= pos/2 && m >= pos/2) return A[amid];
else if (pos/2 > n) return GetMutualMedian(A, B, 1, m, posn);
else (pos/2 > m) return GetMutualMedian(A, B, n, 1, posm);
}
}

shengzhc
March 09, 2013 string sequence(const string &word, char &cur, int &index) {
string ret = “”;
if (word.length() == 0)
return ret;
if (index >= word.length())
return ret;
if (cur == word[index])
ret += ‘!’;
else {
int curValue = (int)(cur’a’+1);
int destValue = (int)(word[index]’a’+1);
ret += string((curValue/5destValue/5)>0 ? ‘u’ : ‘d’, (curValue/5destValue/5));
ret += string((curValue%5destValue%5)>0 ? ‘l’ : ‘r’, (curValue%5destValue%5));
ret += ‘!’;
}
cur = word[index];
index ++;
if (index >= word.length())
return ret;
else return ret+sequence(word, cur, index);
}
 shengzhc March 09, 2013
RepRuzilStaker, Java Freshers at Digital Merkating
Ruzil , a Publicity Specialist with over four years in PR. Also a communicator adept at managing all public relations efforts ...
Reprommie93544, Field Sales at Citrix Online
Roomie , an experienced group fitness instructor with the drive and knowledge and enthusiasm to apply the correct fitness techniques to ...
RepLaylaLee, abc at AMD
Creative and dedicated photo editor with experience in photojournalism and marketing material development. I like to explore Best tantrik in ...
Reprothymellen, Consultant at Accolite software
I am a Correctional officer . I have the primary role of maintaining order within a detention facility. My hobby is ...
RepJaneBraun, Associate at ASAPInfosystemsPvtLtd
Hi, I am Jane From York,PA.My goal is to create a life that I don’t want to ...
RepDaisyRoss, Video game designer at A9
Seeking lead game programmer and position to utilize knowledge and skills to advance portfolio and potential for increased responsibility. Explore ...
RepKianaEmmert, SDE1 at Home Depot
I am Kiana , an Entertainment Journalist, having 5 years of experience, in my career I have covered a lot of ...
RepJoseElkins, Animator at ASU
I am working as Human Resources Associates, and my duties are for obtaining, recording, and interpreting human resources information within ...
RepNirvedDavis, abc at 8x8
Professional lifeguard offering expertise in water safety. Worked for more than six years in guarding and controlling the safety of ...
Repdanikademers, HTML Experienced at Barclays Capital
I am Danika , working as a junior content writer with Jafco where I use my blog writing and social media ...
Repsuzikaily, Digital marketing freshers at ADP
Hi , I am Suzi , working as a dancer in the Rudo club . I have been working here since 2013 and ...
Repandrealmoore45, Analyst at 247quickbookshelp
My name is Andrea and I Live in california. I like to read articles from some interesting topics.And today ...
Replusinisa67, Secretary at Melbourne
Skilled and experienced secretary in Teiscom company. Highly organized with a strong attention to detail and the ability to monitor ...
RepHelenHinkley, Accountant at 8x8
Dedicated EnglishMandarin Chinese translator with years of experience working in professional and scientific communities. I am passionate about how to ...
Repthonylermat, OOPS Experienced at 247quickbookshelp
I have been assigned based on the successful candidate's level of training and experience but will include types of ...
RepPrankHwa, Animator at Accolite software
I am a Reporter and responsible for delivering updates and analysis on current events with the main goal to keep ...
Repjoeevansjoe6, Repairer at Monlinks
I have been functioning as a repairman at monlinks organization for a long time . Here I learn numerous things . My ...
RepMaryMartinez, Jr. Software Engineer at Automated Traders Desk
I am Mary, a knowledgeable sports official skilled at maintaining a safe environment for both players and observers, inspecting the ...
Repjudithasmith175, Accountant at Akamai
Hey, my name is Terry and I completed all my study from California. And Nowadays I am working as a ...
RepHeldaNate, Dev Lead at AMD
I am Helda , a certified Swimming Instructor capable of providing professional lessons and instructions on different swimming styles to various ...
Rephcr689121, Data Engineer at Autonomy Zantaz
Harrison is an electronic data processor experience in electronic data processor and Promotion. I enjoy providing health resources and how ...
I could use a modified dijkstra's algorithm. Initially we assign each entry to be 0 and 1 where there is a path from S to pi. And then we get the group of largest distance we have, and visit each of the points and try to modify the largest distance in our array so we have a new distance array from S to each node in our graph. This step is crucial, consider all situations we might encounter and you will find it is correct. Finally, when we will find our destination point would be the largest distance in the array if the point is a sink.
 shengzhc March 30, 2013