class A{
{
System.out.print(5);//絎簲姝ワ紱絎崄涓姝ワ紱
}
static String str = "x" ;//絎竴姝ワ紱
String s="y";//絎叚姝ワ紱絎崄浜屾錛?br />
static{
System.out.print("1");//絎簩姝ワ紱
}
public A(){
System.out.print("2");//絎竷姝ワ紱絎崄涓夋錛?br />
}
}
class B extends A{
String s="m"; //絎叓姝ワ紱絎崄鍥涙錛?br />
static{
System.out.print("a");//絎笁姝ワ紱
}
static String str = "n" ;//絎洓姝ワ紱
{
System.out.print(6);//絎節姝ワ紱絎崄浜旀錛?br />
}
public B(){
System.out.print("b");//絎崄姝ワ紱絎崄鍏錛?br />
}
}
public class InitialOrder{
public static void main(String[] ars){
A ab = new B(); //鎵ц鍒版澶?緇撴灉: 1a526b
ab = new B(); //鎵ц鍒版澶?緇撴灉: 1a526b526b
}
}
public class Recursion {
public static long factorial(int i) {
if (i < 0)
return -1;
else if (i == 0 || i == 1)
return 1;
else
return i * factorial(i - 1);
}
public static int sum(int i) {
if (i == 0)
return 0;
else
return i + sum(i - 1);
}
public static int fibonacci(int i) {
if (i == 0 || i == 1)
return 1;
else
return fibonacci(i - 1) + fibonacci(i - 2);
}
public static void main(String[] args) {
for (int i = 0; i < 5; i++) {
System.out.println(i + "!= " + factorial(i));
System.out.println("sum(" + i + "!) = " + sum(i));
System.out.println("fibonacci(" + i + ")= " + fibonacci(i));
System.out.println("=========================");
}
}
}