<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/kyle_once</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; kyle_once]]></copyright><item><title><![CDATA[Permutations系列]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/38610745</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/38610745</guid><author>kyle_once</author><pubDate>Sat, 16 Aug 2014 16:05:25 +0800</pubDate><description><![CDATA[1. 全排列递归算法]]></description><category></category></item><item><title><![CDATA[海量数据等概率选取问题]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/38590155</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/38590155</guid><author>kyle_once</author><pubDate>Fri, 15 Aug 2014 20:52:58 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/luxiaoxun/archive/2012/09/09/2677267.html]]></description><category></category></item><item><title><![CDATA[Sort List系列]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/38560367</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/38560367</guid><author>kyle_once</author><pubDate>Thu, 14 Aug 2014 22:20:54 +0800</pubDate><description><![CDATA[在严蔚敏的数据结构书上学习了，各种排序算法]]></description><category></category></item><item><title><![CDATA[Linked List Cycle系列]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/38556045</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/38556045</guid><author>kyle_once</author><pubDate>Thu, 14 Aug 2014 15:49:03 +0800</pubDate><description><![CDATA[1. 判断单链表是否有环]]></description><category></category></item><item><title><![CDATA[Construct Binary Tree系列]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/38523541</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/38523541</guid><author>kyle_once</author><pubDate>Tue, 12 Aug 2014 23:38:04 +0800</pubDate><description><![CDATA[Construct Binary Tree from Preorder and Inorder Traversal
 Total Accepted: 12846 Total
 Submissions: 48716My Submissions




Given preorder and inorder traversal of a tree, construct the binary]]></description><category></category></item><item><title><![CDATA[Binary Tree Level Order Traversal系列]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/38522137</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/38522137</guid><author>kyle_once</author><pubDate>Tue, 12 Aug 2014 22:25:25 +0800</pubDate><description><![CDATA[Binary Tree Level Order Traversal
 




Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
For example:
Given binary tree {3,]]></description><category></category></item><item><title><![CDATA[Binary Tree Traversal系列]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/38520859</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/38520859</guid><author>kyle_once</author><pubDate>Tue, 12 Aug 2014 21:00:33 +0800</pubDate><description><![CDATA[Binary Tree Preorder Traversal
 




Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},

   1
    \
     2
    /
   3


retu]]></description><category></category></item><item><title><![CDATA[Single Number 系列]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/38477609</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/38477609</guid><author>kyle_once</author><pubDate>Sun, 10 Aug 2014 23:49:27 +0800</pubDate><description><![CDATA[Given an array of integers, every element appears twice except for one. Find that single one.

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using ext]]></description><category></category></item><item><title><![CDATA[maven3常用命令、java项目搭建、web项目搭建详细图解]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/18000637</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/18000637</guid><author>kyle_once</author><pubDate>Wed, 08 Jan 2014 14:50:33 +0800</pubDate><description><![CDATA[------------------------------maven3常用命令---------------------------

1、常用命令

　　　　1）创建一个Project

 

mvn archetype:generate -DgroupId=com.mycompany.app -DartifactId=my-app -DarchetypeArtifactId=]]></description><category></category></item><item><title><![CDATA[Maven 环境快速搭建二（eclipse+maven2+jetty）]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17957253</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17957253</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 13:24:45 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/fnng/archive/2011/12/16/2290587.html


本文更新一个命令。

第一节中提示创建一个项目用archetype:create  create是个被废弃或不被推荐使用的插件，在以后创建项目中请尽量使用archetype:generate

创建一个项目，如下：

mvn archetype:genera]]></description><category></category></item><item><title><![CDATA[maven环境快速搭建]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17957205</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17957205</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 13:23:36 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/fnng/archive/2011/12/02/2272610.html


　最近，开发中要用到maven，所以对maven进行了简单的学习。因为有个maven高手在身边，所以，很快就上手了，我这里算是自我总结吧。关于maven是什么东东，请参考其它文章。

----------------准备工作-------------

Jdk ]]></description><category></category></item><item><title><![CDATA[1020	月饼 (25)]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17935311</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17935311</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 00:09:17 +0800</pubDate><description><![CDATA[//PAT1020
//先按价值高到低排序，然后贪心

#include 
#include 
#include 
#include 
#include 

using namespace std;

struct Species
{
	double stock;			//存货
	double total;			//总价
	double price;			//单价
	Species(double ]]></description><category></category></item><item><title><![CDATA[1019	数字黑洞 (20)]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17935275</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17935275</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 00:08:30 +0800</pubDate><description><![CDATA[//PAT1019

#include 
#include 
#include 
#include 

using namespace std;

void vector2i(vector& v, int& sum)		//vector转整型
{
	sum = 0;
	for (int i=0; i<v.size(); i++)
	{
		sum = v[i] + sum * 10;
	}
}

]]></description><category></category></item><item><title><![CDATA[1017	A除以B (20)]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17935245</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17935245</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 00:07:42 +0800</pubDate><description><![CDATA[//PAT1017
//模拟人工手算

#include 
#include 

using namespace std;

void div_string(const string& str, int n, string& quotient, int& remainder)
{
	quotient.clear();
	remainder = 0;
	int cur = 0;		//用于除以  除]]></description><category></category></item><item><title><![CDATA[1016	部分A+B (15)]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17935217</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17935217</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 00:07:07 +0800</pubDate><description><![CDATA[//PAT1016
//通过字符串处理获取新整数字符串，然后转为整型

#include 
#include 
#include 
#include 

using namespace std;

int main()
{
	int a[2];
	int cnt = 0;
	while ( cnt < 2 )
	{
		string str, pstr;
		cin>>str>>pstr;
		i]]></description><category></category></item><item><title><![CDATA[1014	福尔摩斯的约会 (20)]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17935191</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17935191</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 00:06:24 +0800</pubDate><description><![CDATA[//PAT1014
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

inline bool is_week(char ch)
{
	return (ch >= 'A' && ch <= 'G');
}

inline bool is_hour(char ch)
]]></description><category></category></item><item><title><![CDATA[1011	A+B和C (15)]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17935167</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17935167</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 00:05:32 +0800</pubDate><description><![CDATA[//PAT1011
//这题就是死磕自己....
//考虑a,b同号溢出问题，若同号转a > c - b, 异号直接相加判断

#include 

using namespace std;

inline bool isSame(int a, int b)
{
	return ( a > 0 && b > 0 ) || ( a < 0 && b < 0 );
}

int main()
{
	i]]></description><category></category></item><item><title><![CDATA[1005	继续(3n+1)猜想 (25)]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17935133</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17935133</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 00:04:36 +0800</pubDate><description><![CDATA[//PAT1005
//题意：求出数列中不能被其他数覆盖的数，即关键数
//方案：直接使用集合，将被覆盖的数均放入其中，最后遍历数列，若不在集合中，就说明是关键数
#include 
#include 
#include 
#include 
#include 

using namespace std;

void get_overlap_number(set& st, int n)		//获取]]></description><category></category></item><item><title><![CDATA[1003	我要通过！(20)]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17935111</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17935111</guid><author>kyle_once</author><pubDate>Tue, 07 Jan 2014 00:03:38 +0800</pubDate><description><![CDATA[//PAT1003
//规则1和2是基本要求
//规则3：aPbTc ==>  aPbATca，那么可以逆推 aPbATca 到 aPbTc，直到  a'PATa'   这种形式，说明源字符串是符合要求的
//详细说明：aPbTc，则b中每次减少一个A，c中减少a字符串，直到cPATd形式，若c==d，则说明满足规则2，即原串符合要求

#include 
#include 

using nam]]></description><category></category></item><item><title><![CDATA[云计算之美[从菜鸟到高手演练]系列之单节点部署CloudFoundry]]></title><link>https://blog.youkuaiyun.com/kyle_once/article/details/17763147</link><guid>https://blog.youkuaiyun.com/kyle_once/article/details/17763147</guid><author>kyle_once</author><pubDate>Thu, 02 Jan 2014 18:47:03 +0800</pubDate><description><![CDATA[作者：egg

邮箱：xtfggef@gmail.com

微博：http://weibo.com/xtfggef

博客：http://blog.youkuaiyun.com/zhangerqing（转载请说明出处）



一、环境需求

官方系统环境要求：

Setup a VM with a pristine Ubuntu 10.04 Server 64-bit image]]></description><category></category></item></channel></rss>