﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>BlogJava-Hexise's Blog-随笔分类-J2SE</title><link>http://www.blogjava.net/Hexise/category/18790.html</link><description>业精于勤荒于嬉 行成于思毁于随</description><language>zh-cn</language><lastBuildDate>Wed, 28 Feb 2007 07:48:01 GMT</lastBuildDate><pubDate>Wed, 28 Feb 2007 07:48:01 GMT</pubDate><ttl>60</ttl><item><title>[Tip]将Object数组转换为String数组</title><link>http://www.blogjava.net/Hexise/archive/2006/12/29/90717.html</link><dc:creator>Hexise</dc:creator><author>Hexise</author><pubDate>Fri, 29 Dec 2006 05:12:00 GMT</pubDate><guid>http://www.blogjava.net/Hexise/archive/2006/12/29/90717.html</guid><wfw:comment>http://www.blogjava.net/Hexise/comments/90717.html</wfw:comment><comments>http://www.blogjava.net/Hexise/archive/2006/12/29/90717.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/Hexise/comments/commentRss/90717.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/Hexise/services/trackbacks/90717.html</trackback:ping><description><![CDATA[
		<p>这个函数用法经常忘..<br /><font color="#ff0000">(String[])ArrayList.toArray(new String[0]);</font></p>
<img src ="http://www.blogjava.net/Hexise/aggbug/90717.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/Hexise/" target="_blank">Hexise</a> 2006-12-29 13:12 <a href="http://www.blogjava.net/Hexise/archive/2006/12/29/90717.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[复习基础]Java的二叉树遍历操作(递归, 非递归)</title><link>http://www.blogjava.net/Hexise/archive/2006/12/29/90713.html</link><dc:creator>Hexise</dc:creator><author>Hexise</author><pubDate>Fri, 29 Dec 2006 05:01:00 GMT</pubDate><guid>http://www.blogjava.net/Hexise/archive/2006/12/29/90713.html</guid><wfw:comment>http://www.blogjava.net/Hexise/comments/90713.html</wfw:comment><comments>http://www.blogjava.net/Hexise/archive/2006/12/29/90713.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/Hexise/comments/commentRss/90713.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/Hexise/services/trackbacks/90713.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 树节点定义:class TreeNode {    public TreeNode left;    public TreeNode right;    public int value;    public TreeNode(TreeNode left, TreeNode right, int value) {        this.left = left;        this.right...&nbsp;&nbsp;<a href='http://www.blogjava.net/Hexise/archive/2006/12/29/90713.html'>阅读全文</a><img src ="http://www.blogjava.net/Hexise/aggbug/90713.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/Hexise/" target="_blank">Hexise</a> 2006-12-29 13:01 <a href="http://www.blogjava.net/Hexise/archive/2006/12/29/90713.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>