<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[程序与算法的专栏]]></title><description><![CDATA[我不聪明，但我很努力。]]></description><link>https://blog.youkuaiyun.com/linxiao2011</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; linxiao2011]]></copyright><item><title><![CDATA[[Linux]守护进程]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/45478501</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/45478501</guid><author>linxiao2011</author><pubDate>Mon, 04 May 2015 11:31:02 +0800</pubDate><description><![CDATA[/**
 @ 守护进程
 @ 2015-3-12
 */
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

volatile sig_atomic_t _running = 1;
void sigterm_handler(int arg);

in]]></description><category></category></item><item><title><![CDATA[【PHP】一个简单的验证码类]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/22396385</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/22396385</guid><author>linxiao2011</author><pubDate>Fri, 28 Mar 2014 14:26:31 +0800</pubDate><description><![CDATA[初学Php，因为很多地方都涉及到验证码的功能，网上虽然有很多验证码的例子，但是看了之后都不是很满意。于是，自己随便看了一下书，写了一个简单地Php验证码类，可以提供简单的生成一个验证码类。当然，这个类也是刚刚写好，还有很多可以改进的地方。
下面是代码。

<?php
/*
	2014/3/28
	@程序与算法
*/
class checkCode{
	private $m_fontFile ]]></description><category></category></item><item><title><![CDATA[【C++】常量与变量的区别]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/21521001</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/21521001</guid><author>linxiao2011</author><pubDate>Wed, 19 Mar 2014 11:40:10 +0800</pubDate><description><![CDATA[程序员面试或笔试，一般都会考到常量与变量的区别。
	1. 常量的值不可以修改，任何尝试修改常量的操作都会导致编译错误。而变量可以通过赋值来改变。
	2. 常量定义后就不可修改，所以常量在定义时就必须初始化。变量可以定义时暂时不进行初始化。常量初始化的时候必须直接赋值...更多...]]></description><category></category></item><item><title><![CDATA[吝啬的国度]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/21456945</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/21456945</guid><author>linxiao2011</author><pubDate>Tue, 18 Mar 2014 14:14:46 +0800</pubDate><description><![CDATA[描述
在一个吝啬的国度里有N个城市，这N个城市间只有N-1条路把这个N个城市连接起来。现在，Tom在第S号城市，他有张该国地图，他想知道如果自己要去参观第T号城市，必须经过的前一个城市是几号城市（假设你不走重复的路）。




输入第一行输入一个整数M表示测试数据共有M(1
每组测试数据的第一行输入一个正整数N(1
随后的N-1行，每行有两个正整数a,b(1
输出每组测试数据输N]]></description><category></category></item><item><title><![CDATA[【C++】关于指针函数]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/21251659</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/21251659</guid><author>linxiao2011</author><pubDate>Fri, 14 Mar 2014 21:04:57 +0800</pubDate><description><![CDATA[指针函数的运用是面试中的经典题目。]]></description><category></category></item><item><title><![CDATA[【C++】指针与引用的区别]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/21228741</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/21228741</guid><author>linxiao2011</author><pubDate>Fri, 14 Mar 2014 11:12:24 +0800</pubDate><description><![CDATA[1. 非空区别。在任何情况下都不能使用指向空值的引用。 一个引用必须指向某些对象。比如说说下面的程序为错误的。
int &a; // error
指针可以指向一个空的变量。
int *p; // correct
int *pp = NULL; // correct 
2. 合法性区别。在使用引用之前不需要测试其合法性。相反，指针则应总被测试，防止其为空。
3. 可修改区别。指针可以被重新]]></description><category></category></item><item><title><![CDATA[sicily9457. Typo]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/16973209</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/16973209</guid><author>linxiao2011</author><pubDate>Tue, 26 Nov 2013 22:01:08 +0800</pubDate><description><![CDATA[Description

 Bessie has just purchased a new laptop computer, but she unfortunately finds herself unable to type well, given the size of her large hooves relative to the small keyboard.  Bessie has]]></description><category></category></item><item><title><![CDATA[sicily1784. Road Toll]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/11767231</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/11767231</guid><author>linxiao2011</author><pubDate>Tue, 17 Sep 2013 12:08:30 +0800</pubDate><description><![CDATA[Constraints


Time Limit: 1 secs, Memory Limit: 64 MB

Description

There are N cities, identified from 1 to N. There is one and only one road between every two cities. When somebody goes throu]]></description><category></category></item><item><title><![CDATA[哈夫曼树的简单编程-Minimum Weight]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10928203</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10928203</guid><author>linxiao2011</author><pubDate>Mon, 02 Sep 2013 16:24:22 +0800</pubDate><description><![CDATA[Description

Given a list of weights w1, w2, ..., wn, we can construct a binary tree with n leaves, where each leaf is marked with one weight. The is called a weighted binary tree. The weight of the]]></description><category></category></item><item><title><![CDATA[sicily1166. Computer Transformat]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10799771</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10799771</guid><author>linxiao2011</author><pubDate>Sat, 31 Aug 2013 22:11:56 +0800</pubDate><description><![CDATA[Constraints


Time Limit: 1 secs, Memory Limit: 32 MB

Description



A sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the ]]></description><category></category></item><item><title><![CDATA[sicily1687. Permutation]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10470011</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10470011</guid><author>linxiao2011</author><pubDate>Wed, 28 Aug 2013 19:41:11 +0800</pubDate><description><![CDATA[1687. Permutation

Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
Permutation plays a very important role in Combinatorics. 
For example, 1 2 3 4 5 and 1 3 5 4 2 are both 5-perm]]></description><category></category></item><item><title><![CDATA[sicily1034. Forest]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10468449</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10468449</guid><author>linxiao2011</author><pubDate>Wed, 28 Aug 2013 19:03:33 +0800</pubDate><description><![CDATA[Constraints

Time Limit: 1 secs, Memory Limit: 32 MB
Description
In the field of computer science, forest is important and deeply researched , it is a model for many data structures . Now it’s you]]></description><category></category></item><item><title><![CDATA[Longest Common Subsequence: Dynamic Programming]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10458925</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10458925</guid><author>linxiao2011</author><pubDate>Wed, 28 Aug 2013 17:01:19 +0800</pubDate><description><![CDATA[Longest Common Subsequence
Longest Common Subsequence （ LCS ），中文可以譯做「最長共同子序列」。它和 LIS 是不一樣的。 LCS 是兩個 sequence ，在各自所有的 subsequence 之中，一模一樣而且最長的那個 subsequence 。
s1：2 5 7 9 3 1 2
s2：3 5 3 2 8
以上例來看， s]]></description><category></category></item><item><title><![CDATA[sicily1762 排座椅]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10268139</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10268139</guid><author>linxiao2011</author><pubDate>Sat, 24 Aug 2013 15:05:02 +0800</pubDate><description><![CDATA[Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
上课的时候总有一些同学和前后左右的人交头接耳，这是令小学班主任十分头疼的一件事情。不过，班主任小雪发现了一些有趣的现象，当同学们的座次确定下来之后，只有有限的D对同学上课时会交头接耳。同学们在教室中坐成了M行N列，坐在第i行第j列
 

 

 
的同学]]></description><category></category></item><item><title><![CDATA[sicily 1001.  Alphacode]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10088003</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10088003</guid><author>linxiao2011</author><pubDate>Mon, 19 Aug 2013 23:21:47 +0800</pubDate><description><![CDATA[Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

Alice and Bob need to send secret messages to each other and are discussing ways to encode their messages: Alice: "Let's just u]]></description><category></category></item><item><title><![CDATA[sicily1010. Zipper]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10086397</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10086397</guid><author>linxiao2011</author><pubDate>Mon, 19 Aug 2013 21:53:10 +0800</pubDate><description><![CDATA[Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay in its original order. For example, consider forming "]]></description><category></category></item><item><title><![CDATA[[置顶] sicily1007. To and Fro]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10086391</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10086391</guid><author>linxiao2011</author><pubDate>Mon, 19 Aug 2013 21:53:05 +0800</pubDate><description><![CDATA[1007. To and Fro

Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and w]]></description><category></category></item><item><title><![CDATA[sicily1625. Binary Clock]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10086389</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10086389</guid><author>linxiao2011</author><pubDate>Mon, 19 Aug 2013 21:53:00 +0800</pubDate><description><![CDATA[1625. Binary Clock
 

Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
 
A binary clock is a clock which displays traditional sexagesimal time (military format) in a binary forma]]></description><category></category></item><item><title><![CDATA[sicily1155. Can I Post the lette]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10086383</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10086383</guid><author>linxiao2011</author><pubDate>Mon, 19 Aug 2013 21:52:55 +0800</pubDate><description><![CDATA[1155. Can I Post the lette
 

Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
 
I am a traveler. I want to post a letter to Merlin. But because there are so many roads I can wal]]></description><category></category></item><item><title><![CDATA[sicily1198. Substring]]></title><link>https://blog.youkuaiyun.com/linxiao2011/article/details/10086377</link><guid>https://blog.youkuaiyun.com/linxiao2011/article/details/10086377</guid><author>linxiao2011</author><pubDate>Mon, 19 Aug 2013 21:52:50 +0800</pubDate><description><![CDATA[1198. Substring
 

Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
 
Dr lee cuts a string S into N pieces,s[1],…,s[N].   
Now, Dr lee gives you these N sub-strings: s[1],…s[N].]]></description><category></category></item></channel></rss>