Java-Fibonacci sequence, palindrome number, daffodil number

Be a simple Fibonacci sequence

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;
		}
	}

}

Palindrome

import java.util.*;
public class java02 {
	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int[] a=new int[3];
		int i;
		System.out.print("请输入一个"+a.length+"位数：");
		int num=input.nextInt();
		for(i=0;i<a.length;i++) {
			a[i]=num%10;
			num=num/10;
		}
		boolean b=true;  //
		for(i=0;i<a.length;i++) {
		  if(a[i]!=a[a.length-1-i]) {  //如果改为==，则只要有相等的就会跳出，后面的判断不了
			b=false;  //
			break;  //
		}
		}
		if(b==true) {  //
			System.out.println("是回文数！");
		}else {
			System.out.println("不是回文数！");
		}
}
}

Super simple daffodil number

package teste;

public class java01 {
	 public static void main(String args[]) {
	int a=100;
	while (a<=999) {
	int g=a%10;	
	int s=a/10%10;
	int b=a/100;
	
	    if(g*g*g+s*s*s+b*b*b==a) {
	    	
	    	System.out.println("此三位数的水仙花数为"+a);
	}	
	    a++;
	}
	 }	 
}