Java SE ÄÚ²¿ÀàÓ뾲̬±äÁ¿
package demo;
class InOut{
String str=new String("Between");
static int i=666;
int j=888;
final int k=999;
public void amethod(final int iArgs){
int it315;
final int x=111;
/*static*/ class Bicycle
{
// static int i=666;
public void sayHello(){
System.out.println(str);
System.out.println(iArgs);
// System.out.println(it315);
System.out.println(i);
System.out.println(j);
System.out.println(k);
System.out.println(x);
}
}
new Bicycle().sayHello();
}
}
public class TestInnerClass {
public static void main(String[] args) {
InOut i=new InOut();
i.amethod(555);
}
}
Ïà¹ØÎĵµ£º
JDK 5.0 ÖÐÔö¼ÓµÄ·ºÐÍÀàÐÍ£¬ÊÇ Java ÓïÑÔÖÐÀàÐͰ²È«µÄÒ»´ÎÖØÒª¸Ä½ø¡£µ«ÊÇ£¬¶ÔÓÚ³õ´ÎʹÓ÷ºÐÍÀàÐ͵ÄÓû§À´Ëµ£¬·ºÐ͵ÄijЩ·½Ãæ¿´ÆðÀ´¿ÉÄܲ»ÈÝÒ×Ã÷°×£¬ÉõÖÁ·Ç³£Ææ¹Ö¡£ÔÚ±¾ÔµēJava ÀíÂÛºÍʵ¼ù”ÖУ¬Brian Goetz ·ÖÎöÁËÊø¸¿µÚÒ»´ÎʹÓ÷ºÐ͵ÄÓû§µÄ³£¼ûÏÝÚå¡£Äú¿ÉÒÔͨ¹ýÌÖÂÛÂÛ̳Óë×÷ÕßºÍÆäËû¶ÁÕß·ÖÏíÄú¶Ô±¾ÎĵĿ´·¨¡ ......
package algorithm.binarytree;
import java.util.Arrays;
import java.util.Stack;
import util.ArrayUtil;
import util.OutputUtil;
public class BinTree {
private BinNode root = null;
public BinTree()
{
}
&nb ......
Ò»µÀÌ⣬±æJavaʵÁ¦
ÕâÀïÓÐÒ»µÀ¹ØÓÚJavaµÄ»ù´¡µÄ²»ÄÜÔÙ»ù´¡µÄÌ⣬¸÷λѧJavaµÄ¿´¿Í¿ÉÒÔ×ÁÄ¥×ÁÄ¥£¬¿´Êä³öʲô£¬ÎªÊ²Ã´¡£
Èç¹û¿´¿ÍÄÜÕýÈ·»Ø´ð¸ÃÎÊÌ⣬²¢¸ø³öÀíÓÉ£¬ËµÃ÷¿´¹Ù¶ÔJavaµÄÀí½âÒ²ÒÑ´ïµ½Ò»¶ ......
1.MVCµÄ¸÷¸ö²¿·Ö¶¼ÓÐÄÇЩ¼¼ÊõÀ´ÊµÏÖ?ÈçºÎʵÏÖ?
´ð£ºMVCÊÇModel£View£ControllerµÄ¼òд¡£"Model" ´ú±íµÄÊÇÓ¦ÓõÄÒµÎñÂß¼£¨Í¨¹ýJavaBean£¬EJB×é¼þʵÏÖ£©£¬ "View" ÊÇÓ¦ÓõıíÊ¾Ãæ£¨ÓÉJSPÒ³Ãæ²úÉú£©£¬"Controller" ÊÇÌṩӦÓõĴ¦Àí¹ý³Ì¿ØÖÆ£¨Ò»°ãÊÇÒ»¸öServlet£©£¬Í¨¹ýÕâÖÖÉè¼ÆÄ£ÐͰÑÓ¦ÓÃÂß¼£¬´¦Àí¹ý³ÌºÍÏÔʾÂß¼·Ö³É²» ......