58

package com.haizhitao.io;

public class Test1
{
	//循环方式计算阶乘，又叫迭代方式
	public int compute(int number)
	{
		int result = 1;
		
		for(int i = number; i > 0; i--)
		{
			result *= i;
		}
		
		return result;
	}
	
	//使用递归方式计算阶乘
	public int compute2(int number)
	{
		if(1 == number)//定义出口，让递归结束
		{
			return 1;
		}
		else
		{
			return number * compute2(number -1);
		}
	}
	
	public static void main(String[] args)
	{
		Test1 test = new Test1();
		
		System.out.println(test.compute(6));
		System.out.println(test.compute2(6));
	}
}



package com.haizhitao.io;

public class Fab
{
	public int compute(int n)
	{
		if(1 == n || 2 == n)
		{
			return 1;
		}
		
		else
		{
			return compute(n - 1) + compute(n - 2);
		}
	}
	
	public static void main(String[] args)
	{
		Fab fab = new Fab();
		
		System.out.println(fab.compute(9));
	}
}



package com.haizhitao.io;

import java.io.File;

public class FileTest6
{
	public static void deleteAll(File file)
	{
		if(file.isFile() || file.list().length == 0)
		{
			file.delete();
		}
		else
		{
			File[] files = file.listFiles();
			
			for(File file2 : files)
			{
				deleteAll(file2);
				
				file2.delete();
			}
		}
	}
	
	public static void main(String[] args)
	{
		deleteAll(new File("C:/haizhitao\\liu"));
	}
}