<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Believe you fly！]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Believe_fly</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Believe_fly]]></copyright><item><title><![CDATA[360与腾讯qq的战争]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6510372</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6510372</guid><author>Believe_fly</author><pubDate>Wed, 03 Nov 2010 23:18:00 +0800</pubDate><description><![CDATA[奇虎360与腾讯qq的战争打得如火如荼，但是从另一个方面可以看到他们背后的技术团队过硬的技术，面对对方的“挑衅”，如此之快的反应速度让我们不得不佩服]]></description><category></category></item><item><title><![CDATA[荷兰旗问题]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6506772</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6506772</guid><author>Believe_fly</author><pubDate>Sat, 25 Sep 2010 00:49:00 +0800</pubDate><description><![CDATA[直接贴代码吧，也不知道当时是怎么想出来的，一下就想到这么做了Code:    redc = 0;       whitec = N - 1;             for (i=0; i    {           if (pot[i] == 1)//当颜色为红色时，与前面的元素交换，然后判断下一位           {          ]]></description><category></category></item><item><title><![CDATA[后缀表达式求值]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6506771</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6506771</guid><author>Believe_fly</author><pubDate>Sat, 25 Sep 2010 00:37:00 +0800</pubDate><description><![CDATA[只写出了正负整数的加减乘除，没有设计小数的，感觉写的太复杂了，但是又没有想到更简洁的方法Code:    double Calculate(string &postfix)       {           struct          {               double data[MAX];               int top; ]]></description><category></category></item><item><title><![CDATA[二叉树的遍历]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6506770</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6506770</guid><author>Believe_fly</author><pubDate>Sat, 25 Sep 2010 00:30:00 +0800</pubDate><description><![CDATA[刚才看到了一篇关于层序遍历二叉树的帖子，突然想到了自己数据结构作业中写的二叉树的遍历。现在看来，这些并不难了，当时却是费了很大的劲。写了四种遍历方法——前中后序和层序，其中前中后序用到了栈，层序用到了队列。Code:    typedef struct node       {           char data;           struct no]]></description><category></category></item><item><title><![CDATA[终于搞定Ubuntu下汉语的输入了]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6506380</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6506380</guid><author>Believe_fly</author><pubDate>Sat, 18 Sep 2010 22:58:00 +0800</pubDate><description><![CDATA[因为操作系统的实验要在Linux下作，开始接触Ubuntu。我下载的是10.04.1版，在虚拟机安装。打开系统进去一看，全是英文，很不习惯，室友也没有会Linux的，感觉很无奈很无助。没有办法，不会也得会啊，上百度到处找资料，找到很多，但是试了却几乎都没有效果。后来不知道在哪篇文章里看到一条留言，用中文简单描述了一下步骤，可是只是安装语言包的。不管行不行，先安装了再说。找到language s]]></description><category></category></item><item><title><![CDATA[辗转相除求两个数的最大公约数]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6506222</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6506222</guid><author>Believe_fly</author><pubDate>Thu, 16 Sep 2010 17:39:00 +0800</pubDate><description><![CDATA[第一次用C++写，欢迎大家不吝赐教Code:    #include              using namespace std;             class test       {       public:           test();           test(int x, int y);         ]]></description><category></category></item><item><title><![CDATA[中国高校学生遭遇“睡眠危机”]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6489419</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6489419</guid><author>Believe_fly</author><pubDate>Sun, 21 Mar 2010 10:10:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[查找链表中倒数第K个节点]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6488524</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6488524</guid><author>Believe_fly</author><pubDate>Sun, 14 Mar 2010 21:13:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[拓展信息保护领域 卡巴斯基企业级市场持续发力]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6484049</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6484049</guid><author>Believe_fly</author><pubDate>Sun, 10 Jan 2010 18:04:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[微软2010年第一次补丁重点锁定Windows2000]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6484047</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6484047</guid><author>Believe_fly</author><pubDate>Sun, 10 Jan 2010 18:03:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[看完《蜗居》，感觉很空虚]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6483302</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6483302</guid><author>Believe_fly</author><pubDate>Wed, 30 Dec 2009 20:17:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[IT业十大自负CEO出炉]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6467820</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6467820</guid><author>Believe_fly</author><pubDate>Tue, 16 Jun 2009 22:14:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[键盘缓冲区部分状态表示]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/4219094</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/4219094</guid><author>Believe_fly</author><pubDate>Wed, 27 May 2009 05:56:00 +0800</pubDate><description><![CDATA[位址 0040:0017BIT 7 = 1 Insert ONBIT 6 = 1 Caps Lock ONBIT 5 = 1 Num Lock ONBIT 4 = 1 Scroll Lock ONBIT 3 = 1 Alt 按下BIT 2 = 1 Ctrl 按下BIT 1 = 1 左邊 Shift 按下BIT 0 = 1 右邊 Shift 按下位址 0040: 0018BIT 7 = 1 Inse]]></description><category></category></item><item><title><![CDATA[BIOS数据区]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/4219092</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/4219092</guid><author>Believe_fly</author><pubDate>Wed, 27 May 2009 05:52:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[ACM，再见了]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6464396</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6464396</guid><author>Believe_fly</author><pubDate>Fri, 08 May 2009 21:26:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[五月任务]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6463912</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6463912</guid><author>Believe_fly</author><pubDate>Sat, 02 May 2009 23:30:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[四月总结]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6463908</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6463908</guid><author>Believe_fly</author><pubDate>Sat, 02 May 2009 22:54:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[C语言高效编程的四大绝招 - yujinqiong的专栏 - 优快云Blog]]></title><link>https://blog.youkuaiyun.com/Believe_fly/article/details/6463743</link><guid>https://blog.youkuaiyun.com/Believe_fly/article/details/6463743</guid><author>Believe_fly</author><pubDate>Thu, 30 Apr 2009 20:13:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item></channel></rss>