Java-斐波那契数列、回文数、水仙花数

做个比较简单的斐波那契数列

package kjul;

public class jgtd {
	public static void main(String[] args) {
		int n0=0,n1=1,n2;
		int i;
		for(i=1;i<=20;i++) {
			n2=n0+n1;
			System.out.print(n2+" ");
			n0=n1;
			n1=n2;
		}
	}

}
package kjul;

public