<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[firstjava的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/firstjava</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; firstjava]]></copyright><item><title><![CDATA[validator框架总结]]></title><link>https://blog.youkuaiyun.com/firstjava/article/details/5431855</link><guid>https://blog.youkuaiyun.com/firstjava/article/details/5431855</guid><author>firstjava</author><pubDate>Tue, 30 Mar 2010 13:02:00 +0800</pubDate><description><![CDATA[validator框架总结validator框架能够克服在ActionForm Bean中以编程方式进行数据验证的局限，它允许Struts应用灵活的配置验证规则，无需编程。 Validator框架主要依赖两个JAR文件：jakarta-oro.jar和commons-validator,.jar Validator框架采用两个基于XML的配置文件来配置验证规则。这两个文件为valida]]></description><category></category></item><item><title><![CDATA[数字转换为大写金额]]></title><link>https://blog.youkuaiyun.com/firstjava/article/details/5125312</link><guid>https://blog.youkuaiyun.com/firstjava/article/details/5125312</guid><author>firstjava</author><pubDate>Sun, 03 Jan 2010 18:21:00 +0800</pubDate><description><![CDATA[/**  * 将x转换为大写金额形式  *   * @param x  */ public static String fun(String x) {  StringBuffer sb = new StringBuffer();  //判断是否有小数点  int point = x.indexOf(".");  int nLen = x.length();  //截取小数点前的位数  if (po]]></description><category></category></item><item><title><![CDATA[求子矩阵元素最大和]]></title><link>https://blog.youkuaiyun.com/firstjava/article/details/5010072</link><guid>https://blog.youkuaiyun.com/firstjava/article/details/5010072</guid><author>firstjava</author><pubDate>Tue, 15 Dec 2009 11:49:00 +0800</pubDate><description><![CDATA[import java.util.Random;public class MaxSumMatrix { public static void main(String[] args) {  int[][] p = { { 1, 12, -30 }, { 4, -6, 4 }, { -9, 1, 11 } };  int[] k = new int[] { -2, 5, -1, 9, 0 };]]></description><category></category></item><item><title><![CDATA[判断一个除数是否能除尽]]></title><link>https://blog.youkuaiyun.com/firstjava/article/details/4992755</link><guid>https://blog.youkuaiyun.com/firstjava/article/details/4992755</guid><author>firstjava</author><pubDate>Sat, 12 Dec 2009 16:42:00 +0800</pubDate><description><![CDATA[/** *  * @author wll * @date 2009/12/12 */public class SB {  public static void main(String[] args) {    System.out.println((double) (3/8.0));  System.out.println(fun(1, 7));  System.out.println(f]]></description><category></category></item><item><title><![CDATA[动态规划]]></title><link>https://blog.youkuaiyun.com/firstjava/article/details/4990640</link><guid>https://blog.youkuaiyun.com/firstjava/article/details/4990640</guid><author>firstjava</author><pubDate>Sat, 12 Dec 2009 11:09:00 +0800</pubDate><description><![CDATA[    动态规划主要用于求解包含重叠子问题的最优化问题的方法。其基本思想是，将原问题分解为相似的子问题，在求解的过程中通过子问题的解求出原问题的解。 应用动态规划有两个基本条件：1.最优子结构将问题分解为子问题，子问题最优解决定全局最优解。2.子问题重叠性质子问题重叠性质是指在用递归算法自顶向下对问题进行求解时，每次产生的子问题并不总是新问题，有些子问题会被重复计算多次。]]></description><category></category></item><item><title><![CDATA[创建一个包含15个随机整数（0～9）的列表，然后去掉其中的所有重复数字。]]></title><link>https://blog.youkuaiyun.com/firstjava/article/details/4799463</link><guid>https://blog.youkuaiyun.com/firstjava/article/details/4799463</guid><author>firstjava</author><pubDate>Wed, 11 Nov 2009 18:26:00 +0800</pubDate><description><![CDATA[ import java.awt.Color;import java.awt.Cursor;import java.awt.Font;import java.awt.GridLayout;import java.awt.event.ActionEvent;import java.awt.event.ActionListener;import java.util.LinkedList;impor]]></description><category></category></item></channel></rss>