重构 优化斐波那契数列--Java

package fab;

public class fab {
	
	    public int m[];
	    public  int k;
	    public int n;
	    public fab(int k,int n)
	    {   this.n=n; 
	    	this.k=k;
	    	this.m=new int[k];
	    	
	    }
	    
		public int fabs(int n)
		{  
		    if(m[n]==1){  
		        return m[n];  
		    }  
		    else{  
		        m[n] = fabs(n - 1) + fabs(n - 2);  
		        return m[n];  
		    }  
		}  
		  
		public  int memFab()  
		{  
		    int i;  
		    m[0] = 1;  
		    m[1] = 1;  
		    for(i = 2; i<this.k; ++i){  
		        m[i] = 0;  
		    }  
		    return fabs(this.n);  
		}  	
}

</pre><pre name="code" class="java">

</pre><p>测试类test.java</p><p></p><p><pre name="code" class="java">package fab;
import fab.fab;
public class test {
	public static void main(String args[])
	{
		fab	f=new fab(50,19);
		int fn=f.memFab();
		System.out.println(fn);
	}

}