﻿<?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-Java杂家-最新评论</title><link>http://www.blogjava.net/javacap/CommentsRSS.aspx</link><description>杂七杂八。。。一家之言</description><language>zh-cn</language><pubDate>Mon, 27 Dec 2021 21:33:50 GMT</pubDate><lastBuildDate>Mon, 27 Dec 2021 21:33:50 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 运行时注入你的Java代码到一个已经在运行的Java程序</title><link>http://www.blogjava.net/javacap/archive/2015/04/07/91735.html#424184</link><dc:creator>ww</dc:creator><author>ww</author><pubDate>Tue, 07 Apr 2015 06:53:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2015/04/07/91735.html#424184</guid><description><![CDATA[wroker.dll 和 vmattach.dll有源码吗？求分享<img src ="http://www.blogjava.net/javacap/aggbug/424184.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">ww</a> 2015-04-07 14:53 <a href="http://www.blogjava.net/javacap/archive/2015/04/07/91735.html#424184#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 向上取整的一个应用</title><link>http://www.blogjava.net/javacap/archive/2014/08/31/268781.html#417531</link><dc:creator>上海码农</dc:creator><author>上海码农</author><pubDate>Sun, 31 Aug 2014 04:12:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2014/08/31/268781.html#417531</guid><description><![CDATA[当N等于0的时候貌似不成立<img src ="http://www.blogjava.net/javacap/aggbug/417531.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">上海码农</a> 2014-08-31 12:12 <a href="http://www.blogjava.net/javacap/archive/2014/08/31/268781.html#417531#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 红黑树的Java实现</title><link>http://www.blogjava.net/javacap/archive/2014/02/26/169120.html#410347</link><dc:creator>super fly</dc:creator><author>super fly</author><pubDate>Wed, 26 Feb 2014 12:38:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2014/02/26/169120.html#410347</guid><description><![CDATA[怎么找到这个DefaultBSTree和BSTree啊？@new<img src ="http://www.blogjava.net/javacap/aggbug/410347.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">super fly</a> 2014-02-26 20:38 <a href="http://www.blogjava.net/javacap/archive/2014/02/26/169120.html#410347#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 红黑树的Java实现</title><link>http://www.blogjava.net/javacap/archive/2014/02/26/169120.html#410346</link><dc:creator>super fly</dc:creator><author>super fly</author><pubDate>Wed, 26 Feb 2014 12:27:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2014/02/26/169120.html#410346</guid><description><![CDATA[想问一下，这个是完整，直接能用的代码吗？？？好像是不怎么行耶？<img src ="http://www.blogjava.net/javacap/aggbug/410346.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">super fly</a> 2014-02-26 20:27 <a href="http://www.blogjava.net/javacap/archive/2014/02/26/169120.html#410346#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 红黑树的Java实现</title><link>http://www.blogjava.net/javacap/archive/2014/02/02/169120.html#409485</link><dc:creator>new</dc:creator><author>new</author><pubDate>Sun, 02 Feb 2014 08:47:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2014/02/02/169120.html#409485</guid><description><![CDATA[删除部分的代码貌似不对啊。<br>如果删除的是一个左右子树都存在的节点，那么成分会先找到前序节点，并把cur指向该节点（该节点没有右子树存在）。<br>接下来进入判断，如果cur存在左子树，把左子树赋给cur的父节点。<br>问题在于被删除节点的父节点和cur之间没有了关联（没有设置）。<br>而且对于某些额情况，还会存在左子树作为了被删除节点的子树。例如，对于深度为2的满二叉树，对左1添加子节点之后，删除根节点的左节点。<br><br>请楼主再仔细验证一下。<img src ="http://www.blogjava.net/javacap/aggbug/409485.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">new</a> 2014-02-02 16:47 <a href="http://www.blogjava.net/javacap/archive/2014/02/02/169120.html#409485#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 图及其算法复习（Java实现) 一：存储结构，深度优先周游，广度优先周游[未登录]</title><link>http://www.blogjava.net/javacap/archive/2013/05/26/167764.html#399788</link><dc:creator>123</dc:creator><author>123</author><pubDate>Sun, 26 May 2013 13:38:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2013/05/26/167764.html#399788</guid><description><![CDATA[&lt;script&gt;alert(1);&lt;script&gt;<img src ="http://www.blogjava.net/javacap/aggbug/399788.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">123</a> 2013-05-26 21:38 <a href="http://www.blogjava.net/javacap/archive/2013/05/26/167764.html#399788#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 使用赢者树的外部排序</title><link>http://www.blogjava.net/javacap/archive/2013/01/13/168034.html#394157</link><dc:creator>YorkTsai</dc:creator><author>YorkTsai</author><pubDate>Sun, 13 Jan 2013 09:41:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2013/01/13/168034.html#394157</guid><description><![CDATA[拜读完毕，写的太棒了，很多细节处理的很妙啊。。<img src ="http://www.blogjava.net/javacap/aggbug/394157.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">YorkTsai</a> 2013-01-13 17:41 <a href="http://www.blogjava.net/javacap/archive/2013/01/13/168034.html#394157#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 使用赢者树的外部排序</title><link>http://www.blogjava.net/javacap/archive/2013/01/13/168034.html#394156</link><dc:creator>YorkTsai</dc:creator><author>YorkTsai</author><pubDate>Sun, 13 Jan 2013 09:40:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2013/01/13/168034.html#394156</guid><description><![CDATA[把源码都下载下来，把项目导入Eclipse中，CreateFile（含有main方法）用来生成随机数据到一个文件，大小达4GB；ExternalSorter（含有main方法）用来对前面生成的文件进行外排序。@jason<br><img src ="http://www.blogjava.net/javacap/aggbug/394156.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">YorkTsai</a> 2013-01-13 17:40 <a href="http://www.blogjava.net/javacap/archive/2013/01/13/168034.html#394156#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 红黑树的Java实现[未登录]</title><link>http://www.blogjava.net/javacap/archive/2013/01/05/169120.html#393815</link><dc:creator>大大</dc:creator><author>大大</author><pubDate>Sat, 05 Jan 2013 06:39:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2013/01/05/169120.html#393815</guid><description><![CDATA[干你妈比的，要么写中文注释，要么死回你妈比里去，会俩英文，拽尼玛腿啊<img src ="http://www.blogjava.net/javacap/aggbug/393815.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">大大</a> 2013-01-05 14:39 <a href="http://www.blogjava.net/javacap/archive/2013/01/05/169120.html#393815#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 排序算法复习（Java实现）(二）： 归并排序，堆排序，桶式排序，基数排序</title><link>http://www.blogjava.net/javacap/archive/2012/10/06/167618.html#389096</link><dc:creator>endual</dc:creator><author>endual</author><pubDate>Sat, 06 Oct 2012 08:14:00 GMT</pubDate><guid>http://www.blogjava.net/javacap/archive/2012/10/06/167618.html#389096</guid><description><![CDATA[马桶排序还是不太懂，<br>而且这算法书上讲的乱气八糟啊<img src ="http://www.blogjava.net/javacap/aggbug/389096.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/javacap/" target="_blank">endual</a> 2012-10-06 16:14 <a href="http://www.blogjava.net/javacap/archive/2012/10/06/167618.html#389096#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>