Ackerman函数 非递归 java,如何以非递归方式重写Ackermann函数？

I have function

public static int func(int M,int N){

if(M == 0 || N == 0) return M+N+1;

return func(M-1, func(M, N-1));

}

How to rewrite it in non-recursive style ?

Maybe, is it implementation some algorithm?

解决方案

Not quite O(1) but definitely non-recursive.

public static int itFunc(int m, int n){

Stack s = new Stack;

s.add(m);

while(!s.isEmpty()){

m=s.pop();

if(m==0||n==0)

n+=m+1;

else{

s.add(--m);

s.add(++m);

n--;

}

}

return n;

}