10 2011 档案
摘要:1. reverse a stack with recursionvoid reverse_push(stack<int> &stk, int x){ if(stk.empty()) { stk.push(x); return; } int temp = stk.top(); stk.pop(); reverse_push(stk, x); stk.push (temp);}void reverse(stack<int>& stk){ if(stk.empty()) { cout<<"aaa"<<endl; r
阅读全文
摘要:1. strstr() - retun pointer to the first occurence of substring in string.char* strstr(char *str, char *substr){ int i = 0; int str_len = strlen(str); int sub_len = strlen(substr); while (i <= str_len - sub_len) { int j = 0; while (str[i] == substr[j] && j<sub_len) { i++; j++; } if (j
阅读全文