JavaÌṩdelete¹Ø¼ü×Ö±ØÒªÐÔ
×î½üÔÚдJava³ÌÐò´¦Àí´óÁ¿Êý¾ÝµÄʱºòÄÚ´æÍùÍùËæ×ųÌÐòÖ´ÐеÄÊý´ÎÔö¼Ó¶øÔö¼Ó, ×î´óʱÉÏÕǵ½1.XGÒÔÉÏ, ×îÖÕJVMÄÚ´æÓþ¡, ³ÌÐòÒì³£ÖÕÖ¹,ÔÚ³ÌÐòÖÐÒѾ½«ÄÜ»ØÊյıäÁ¿¶¼ÖÃΪnullÁË, »¹ÊDz»ÄÜʵʱ»ØÊÕÄÚ´æ, Ïëµ½C++µÄµÄ×ö·¨, ÓÐÎö¹¹º¯ÊýºÍdelete, ¿ÉÒÔ¼°Ê±µÄ»ØÊÕÄÚ´æ, JCPÄÜ·ñ¿ÉÒÔ¿¼ÂÇÒ»ÏÂÔÚJDK7ÖÐÔö¼Ódelete¹Ø¼ü×Ö, ÈÃJavaÒ²ÄÜÏñC++Ò»Ñùʵʱ»ØÊÕÄÚ´æ?
Ïà¹ØÎĵµ£º
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 ......
¿ÉÄܺܶ࿪·¢Õß»áÃæ¶Ô¿Í»§ÕâÑùµÄÐèÇó£¬ÔÚδʹÓÃϵͳ֮ǰ£¬ËûÃǺܶàÊý¾Ý¶¼ÊDZ£´æÔÚWord»òÕßExcelµÈһЩµç×Ó±í¸ñÖУ¬ÏÖÔÚËûÃÇÐèÒª½«ÔÀ´µÄÊý¾Ý×Ô¶¯µ¼È뵽ϵͳÖÐÈ¥£¬¶ø²»ÊÇÒ»ÌõÒ»ÌõµØÊÖ¹¤Â¼Èë¡£ÎÒ¾ÍÅöµ½ÁËÕâÑùµÄÐèÇ󣬾¹ýÒ»·¬ÕÛÌÚÖ®ºó£¬ÖÕÓÚʵÏÖÁË£¬ÎÒÊDzÉÓõÚÈý·½¿Ø¼þJXLʵÏֵģ¬ÔÀíÊDZȽϼ ......
´ÓJava1.1¿ªÊ¼ÒýÈëÁËÄÚ²¿ÀàÒÔÀ´£¬Ëü¾ÍÒýÆðÁËÈËÃǵļ¤ÁÒÕùÂÛ¡£ÆäʵÈκÎÓÅÐãµÄÓïÑÔÌØÐÔÓõò»ºÃ¾ÍÊÇÀÄÓã¬ÄÚ²¿ÀàÓõò»ºÃ¾Í»áµ¼Ö´úÂëÏñÃÔ¹¬Ò»Ñù£¬µ¼Ö³öÏÖºÁÎÞÖØÓõÄ×ÛºÏÕ÷¡£
1¡¢ÄÚ²¿Àà·ÖΪ³ÉÔ±ÄÚ²¿Àà¡¢¾²Ì¬Ç¶Ì×Àà¡¢·½·¨ÄÚ²¿Àà¡¢ÄäÃûÄÚ²¿Àà¡£
¼¸ÖÖÄÚ²¿ÀàµÄ¹²ÐÔ£º
A¡¢ÄÚ²¿ÀàÈÔÈ»ÊÇÒ»¸ö¶ÀÁ¢µÄÀ࣬ÔÚ±àÒëÖ®ºó»áÄÚ²¿Àà»á±»±àÒ ......
public static void getSysProp(){
Properties props = System.getProperties();
Set<Entry<Object,Object>> res = props.entrySet();
Iterator it = res.iterator();
while (it.hasNext())
{
Map.Entry e = (Map.Entry)it.next();
......