汉诺塔
void Hanoi(int n,string A,string B,string C){
//move disk from A to C by B
//stop
if(n==1){
//simpliy move
cout<<"move one disk from"<<A<<"to"<<C<<endl;
}
//move by move(n-1)
Hanoi(n-1,A,C,B);
cout<<"move one disk from"<<A<<"to"<<B<<endl;
Hanoi(n-1,C,A,B);
}
逆转链表
template<class T>
void LinkReverse(LinkList<T> &l){
LinkNode<T> p=l.first->link;
p=_LinkReverse(p);
l.first->link=p;
}
LinkNode<T>* _LinkReverse(LinkNode<T> *l){
if(l==NULL){
return NULL;
}
if(l->link=NULL)
return l;
return _LinkReverse(l->link);
LinkNode<T> prev=l;
LinkNode<T> p=l->link;
prev->link=p->link;
p->link=prev;
/*
better solution
LinkNode<T> prev=l;
LinkNode<T> p=l->link;
prev->link=p->link;
p->link=prev;
return _LinkReverse(l->link);
*/
}
字符串逆转
class Solution {
public:
void Reverse(vector<char> &s,int m,int n){
if(m>=n){
return;
}
char temp=s[m];
s[m]=s[n];
s[n]=temp;
Reverse(s,m+1,n-1);
}
void reverseString(vector<char>& s) {
Reverse(s,0,s.size()-1);
}
};
//前序和中序和后序
//尾递归空间效率比头递归效率要高不少,但时间效率相同
/*当f(n)=f(n1)+f(n2)+...+f(nk)时,可采用缓存记忆的方式,将每一项的f(ni)记
录下来再总和结果,以避免重复计算,为便于寻找,一般用散列表来存储中间结果*/
class Solution {
public:
int fib(int N) {
map<int,int> cache;
int res;
if(cache.count(N)==1)
return cache[N];
if(N==0)
res=0;
if(N==1)
res=1;
res=fib(N-1)+fib(N-2);
//return and continue
//store result
cache.insert(map<int,int>::value_type(N, res));
return res;
}
};