﻿<?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>IT博客-Java部落</title><link>http://www.cnitblog.com/intrl/</link><description>大家齐努力，成功共分享！
          ------庖丁解牛</description><language>zh-cn</language><lastBuildDate>Wed, 29 Apr 2026 06:01:15 GMT</lastBuildDate><pubDate>Wed, 29 Apr 2026 06:01:15 GMT</pubDate><ttl>60</ttl><item><title>Se</title><link>http://www.cnitblog.com/intrl/archive/2011/12/07/76557.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Wed, 07 Dec 2011 06:20:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2011/12/07/76557.html</guid><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: servlet&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2011/12/07/76557.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/76557.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2011-12-07 14:20 <a href="http://www.cnitblog.com/intrl/archive/2011/12/07/76557.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java EE】【ANT专辑 二】ANT在Web项目中的应用--核心任务</title><link>http://www.cnitblog.com/intrl/archive/2009/07/25/60364.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 25 Jul 2009 08:34:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/07/25/60364.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/60364.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/07/25/60364.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/60364.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/60364.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二、ANT实践<br>（一）、基本任务<br>1、ANT Task：&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/07/25/60364.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/60364.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-07-25 16:34 <a href="http://www.cnitblog.com/intrl/archive/2009/07/25/60364.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java EE】【ANT专辑 一】ANT在Web项目中的应用--工具介绍</title><link>http://www.cnitblog.com/intrl/archive/2009/07/25/60358.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 25 Jul 2009 08:30:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/07/25/60358.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/60358.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/07/25/60358.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/60358.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/60358.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一、ANT介绍<br>Ant是Apache软件基金会JAKARTA目录中的一个子项目......&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/07/25/60358.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/60358.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-07-25 16:30 <a href="http://www.cnitblog.com/intrl/archive/2009/07/25/60358.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java EE】Struts2.1.6+Spring2.5.6+Hibernate3.3.1整合开发--验证框架、国际化</title><link>http://www.cnitblog.com/intrl/archive/2009/07/01/59762.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Wed, 01 Jul 2009 07:41:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/07/01/59762.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/59762.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/07/01/59762.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/59762.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/59762.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在之前发表的“Struts2.1.6+Spring2.5.6+Hibernate3.3.1框架 整合开发”的基础上加入验证框架和国际化&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/07/01/59762.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/59762.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-07-01 15:41 <a href="http://www.cnitblog.com/intrl/archive/2009/07/01/59762.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】int[]数组按地址排序</title><link>http://www.cnitblog.com/intrl/archive/2009/06/01/58956.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Mon, 01 Jun 2009 15:47:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/06/01/58956.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/58956.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/06/01/58956.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/58956.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/58956.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: int[]数组按地址排序&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/06/01/58956.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/58956.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-06-01 23:47 <a href="http://www.cnitblog.com/intrl/archive/2009/06/01/58956.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】邮票问题</title><link>http://www.cnitblog.com/intrl/archive/2009/05/22/58713.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Fri, 22 May 2009 15:52:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/05/22/58713.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/58713.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/05/22/58713.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/58713.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/58713.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 1.      问题描述<br>设有n种不同面值a1, a2,…, an的邮票，规定每封信最多贴m张邮票。对于给定的m，n，求出最大的邮资连续区间。例如，给定n=3，m=3，邮票面值分别为2, 3, 5，则最大的邮资连续区间为[2，13]。&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/05/22/58713.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/58713.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-05-22 23:52 <a href="http://www.cnitblog.com/intrl/archive/2009/05/22/58713.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java SE】AWT的菜单</title><link>http://www.cnitblog.com/intrl/archive/2009/05/17/57273.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sun, 17 May 2009 07:36:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/05/17/57273.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/57273.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/05/17/57273.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/57273.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/57273.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 示例程序：&nbsp;&nbsp;1/**&nbsp;*//**&nbsp;&nbsp;2&nbsp;&nbsp;*&nbsp;@(#)TestLayout.java&nbsp;&nbsp;3&nbsp;&nbsp;*&nbsp;&nbsp;4&nbsp;&nbsp;*&nbsp;&nbsp;5&nbsp;&nbsp;*&nbsp;@author&nbsp;叶云策（intrl）&nbsp;&n...&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/05/17/57273.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/57273.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-05-17 15:36 <a href="http://www.cnitblog.com/intrl/archive/2009/05/17/57273.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java SE】布局管理器</title><link>http://www.cnitblog.com/intrl/archive/2009/05/17/57271.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 16 May 2009 16:39:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/05/17/57271.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/57271.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/05/17/57271.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/57271.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/57271.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: AWT提供了FlowLayout、BorderLayout、GriderLayout、GridBagLayout、CardLayout五个常用的布局管理器，Swing还提供了一个BoxLayout布局管理器&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/05/17/57271.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/57271.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-05-17 00:39 <a href="http://www.cnitblog.com/intrl/archive/2009/05/17/57271.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】黑白点的匹配</title><link>http://www.cnitblog.com/intrl/archive/2009/04/26/56734.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sun, 26 Apr 2009 05:00:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/26/56734.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56734.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/26/56734.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56734.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56734.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 1、问题描述<br>设平面上分布着n个白点和n个黑点，每个点用一对坐标（x, y）表示。一个黑点b=（xb,yb）支配一个白点w=(xw, yw)当且仅当xb>=xw和yb>=yw。若黑点b支配白点w，则黑点b和白点w可匹配（可形成一个匹配对）。在一个黑点最多只能与一个白点匹配，一个白点最多只能与一个黑点匹配的前提下，求n个白点和n个黑点的最大匹配对数。&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/26/56734.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56734.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-26 13:00 <a href="http://www.cnitblog.com/intrl/archive/2009/04/26/56734.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】递归算法举例</title><link>http://www.cnitblog.com/intrl/archive/2009/04/25/56718.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 25 Apr 2009 15:43:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/25/56718.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56718.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/25/56718.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56718.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56718.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 递归算法举例（Java实现）&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/25/56718.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56718.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-25 23:43 <a href="http://www.cnitblog.com/intrl/archive/2009/04/25/56718.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】归并排序</title><link>http://www.cnitblog.com/intrl/archive/2009/04/25/56717.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 25 Apr 2009 15:41:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/25/56717.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56717.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/25/56717.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56717.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56717.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 归并排序Java实现&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/25/56717.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56717.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-25 23:41 <a href="http://www.cnitblog.com/intrl/archive/2009/04/25/56717.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】快速排序</title><link>http://www.cnitblog.com/intrl/archive/2009/04/25/56716.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 25 Apr 2009 15:38:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/25/56716.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56716.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/25/56716.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56716.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56716.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 快速排序Java实现&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/25/56716.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56716.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-25 23:38 <a href="http://www.cnitblog.com/intrl/archive/2009/04/25/56716.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】插入排序</title><link>http://www.cnitblog.com/intrl/archive/2009/04/25/56715.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 25 Apr 2009 15:37:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/25/56715.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56715.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/25/56715.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56715.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56715.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 插入排序Java实现&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/25/56715.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56715.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-25 23:37 <a href="http://www.cnitblog.com/intrl/archive/2009/04/25/56715.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】选择排序</title><link>http://www.cnitblog.com/intrl/archive/2009/04/25/56714.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 25 Apr 2009 15:34:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/25/56714.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56714.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/25/56714.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56714.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56714.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 选择排序Java实现<br>&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/25/56714.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56714.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-25 23:34 <a href="http://www.cnitblog.com/intrl/archive/2009/04/25/56714.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】冒泡排序</title><link>http://www.cnitblog.com/intrl/archive/2009/04/25/56713.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 25 Apr 2009 15:33:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/25/56713.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56713.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/25/56713.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56713.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56713.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 冒泡排序Java实现&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/25/56713.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56713.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-25 23:33 <a href="http://www.cnitblog.com/intrl/archive/2009/04/25/56713.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java EE】扩展 Ant JUnit Task（转）</title><link>http://www.cnitblog.com/intrl/archive/2009/04/19/56479.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sun, 19 Apr 2009 08:35:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/19/56479.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56479.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/19/56479.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56479.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56479.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 尽管 Ant 自带的 JUnit task 命令可以非常方便的进行测试用例的选择，但是有些情况下依然无法满足特定工程的需要。由于 Ant 自身的良好的扩展性，开发者可以扩展 Ant JUnit，使它能够通过设置正则表达式来支持更灵活的选择。在了解了 Ant 的扩展机制之后，扩展的过程其实比较轻松。更好的是，扩展之后的 Ant JUnit 命令能够保持对原有命令的完全兼容性。&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/19/56479.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56479.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-19 16:35 <a href="http://www.cnitblog.com/intrl/archive/2009/04/19/56479.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java SE】Java 理论和实践之 了解泛型（转）</title><link>http://www.cnitblog.com/intrl/archive/2009/04/19/56478.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sun, 19 Apr 2009 08:22:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/19/56478.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56478.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/19/56478.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56478.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56478.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: JDK 5.0 中增加的泛型类型，是 Java 语言中类型安全的一次重要改进。但是，对于初次使用泛型类型的用户来说，泛型的某些方面看起来可能不容易明白，甚至非常奇怪。&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/19/56478.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56478.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-19 16:22 <a href="http://www.cnitblog.com/intrl/archive/2009/04/19/56478.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【算法】加油问题</title><link>http://www.cnitblog.com/intrl/archive/2009/04/19/56471.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 18 Apr 2009 17:10:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/19/56471.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56471.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/19/56471.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56471.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56471.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 1. 问题描述 <br>一个旅行家想驾驶汽车从城市A到城市B（设出发时油箱是空的）。给定两个城市之间的距离dis、汽车油箱的容量c、每升汽油能行驶的距离d、沿途油站数n、油站i离出发点的距离d[i]以及该站每升汽油的价格p[i],i=1,2,…,n。设d[1]=0<d[2]<…<d[n]。要花最少的油费从城市A到城市B，在每个加油站应加多少油，最少花费为多少？<br>2.……&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/19/56471.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56471.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-19 01:10 <a href="http://www.cnitblog.com/intrl/archive/2009/04/19/56471.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java EE】struts2国际化</title><link>http://www.cnitblog.com/intrl/archive/2009/04/18/56464.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 18 Apr 2009 08:03:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/18/56464.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56464.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/18/56464.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56464.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56464.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: （一）国际化简介<br>1、jsp页面的国际化<br>2、action中validate方法中增加错误信息的国际化<br>3、xml验证框架中错误信息的国际化<br>4、struts表单的国际化<br>（二）国际化资源文件的类别：全局、局部<br>（三）在浏览器中设置不同的语言首选项即可看到国际化的效果&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/18/56464.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56464.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-18 16:03 <a href="http://www.cnitblog.com/intrl/archive/2009/04/18/56464.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【Java EE】struts2验证框架</title><link>http://www.cnitblog.com/intrl/archive/2009/04/18/56457.html</link><dc:creator>intrl</dc:creator><author>intrl</author><pubDate>Sat, 18 Apr 2009 05:15:00 GMT</pubDate><guid>http://www.cnitblog.com/intrl/archive/2009/04/18/56457.html</guid><wfw:comment>http://www.cnitblog.com/intrl/comments/56457.html</wfw:comment><comments>http://www.cnitblog.com/intrl/archive/2009/04/18/56457.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/intrl/comments/commentRss/56457.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/intrl/services/trackbacks/56457.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 要对某个action进行验证，只需在同包下建立验证文件，如要验证LoginAction.java需建立LoginAction-validation.xml<br>详细配置参考请参阅：<br>xwork-2.1.2.jar/com.opensymphony.xwork2.validator.validators&nbsp;&nbsp;<a href='http://www.cnitblog.com/intrl/archive/2009/04/18/56457.html'>阅读全文</a><img src ="http://www.cnitblog.com/intrl/aggbug/56457.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/intrl/" target="_blank">intrl</a> 2009-04-18 13:15 <a href="http://www.cnitblog.com/intrl/archive/2009/04/18/56457.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>