<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[gt1983的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/gt1983</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; gt1983]]></copyright><item><title><![CDATA[取东西算法]]></title><link>https://blog.csdn.net/gt1983/article/details/51705027</link><guid>https://blog.csdn.net/gt1983/article/details/51705027</guid><author>gt1983</author><pubDate>Sat, 18 Jun 2016 10:50:44 +0800</pubDate><description><![CDATA[/* 
 * 一个字符串， A，B两个人轮流来取走一个字符，如果取走一个后
 * 剩下的字符串是从小到大排列（ascii顺序），认为那个人获胜。
 * 给定一个字符串， 问A是否可以获胜
*/
package com.test;


public class CharactorCount {

static boolean[][] process = null; 

/**]]></description><category></category></item><item><title><![CDATA[简单的分东西算法]]></title><link>https://blog.csdn.net/gt1983/article/details/51705004</link><guid>https://blog.csdn.net/gt1983/article/details/51705004</guid><author>gt1983</author><pubDate>Sat, 18 Jun 2016 10:45:59 +0800</pubDate><description><![CDATA[/*
 * 有m个物品放到n个容器中，全部放完， 有的容器可以不放
 * 问有多少种放法
*/             
package com.test;


public class DivideApple {


/**
* @param m
* @param n
*/
public static void divideAppleMethod(int m, int]]></description><category></category></item></channel></rss>