<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[_Legolas_的技术专栏]]></title><description><![CDATA[Don’t Call Me a Programmer]]></description><link>https://blog.youkuaiyun.com/everthing99</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; everthing99]]></copyright><item><title><![CDATA[Implement strStr() [LeetCode] + KMP]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/25310883</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/25310883</guid><author>everthing99</author><pubDate>Thu, 08 May 2014 15:36:00 +0800</pubDate><description><![CDATA[Implement strStr().

Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.

实现了下，KMP算法明显速度提高y]]></description><category></category></item><item><title><![CDATA[N-Queens And N-Queens II [LeetCode] + Generate Parentheses[LeetCode] + 回溯法]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/25279373</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/25279373</guid><author>everthing99</author><pubDate>Thu, 08 May 2014 10:09:05 +0800</pubDate><description><![CDATA[Follow up for N-Queens problem.

Now, instead outputting board configurations, return the total number of distinct solutions.]]></description><category></category></item><item><title><![CDATA[腾讯暑期实习笔试题-上海-后台开发]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/24198347</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/24198347</guid><author>everthing99</author><pubDate>Sun, 20 Apr 2014 21:51:43 +0800</pubDate><description><![CDATA[附加题
1. mapReduce 解释，最好配图介绍？
2.]]></description><category></category></item><item><title><![CDATA[俄罗斯方块，4个方块的形状有5个，5个方块呢？6个？]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/24096755</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/24096755</guid><author>everthing99</author><pubDate>Sat, 19 Apr 2014 10:51:06 +0800</pubDate><description><![CDATA[转自：http://www.zhihu.com/question/20540487
曾经做过一个俄罗斯方块游戏，收集资料时见识过几种：

四格骨牌（Tetromino）[1]
俄罗斯方块（Tetris ）名称就是变形自词缀「四」（ tetra），可以发现这种可变形状比较少。

五格骨牌（Pentomino）[2]


六格骨牌（Hexomino）[3]



[1] ht]]></description><category></category></item><item><title><![CDATA[Reorder List[LeetCode]]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/23601035</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/23601035</guid><author>everthing99</author><pubDate>Sun, 13 Apr 2014 14:20:41 +0800</pubDate><description><![CDATA[Reorder List







Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You must do this in-place without altering the nodes' values.

For example,
Giv]]></description><category></category></item><item><title><![CDATA[Insertion Sort List[LeetCode]]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/23591157</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/23591157</guid><author>everthing99</author><pubDate>Sun, 13 Apr 2014 10:13:21 +0800</pubDate><description><![CDATA[Insertion Sort List
 



Sort a linked list using insertion sort.



/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int ]]></description><category></category></item><item><title><![CDATA[Pascal's Triangle [LeetCode]]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/23425819</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/23425819</guid><author>everthing99</author><pubDate>Fri, 11 Apr 2014 10:08:11 +0800</pubDate><description><![CDATA[Given numRows, generate the first numRows of Pascal's triangle.

For example, given numRows = 5,
Return
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]]]></description><category></category></item><item><title><![CDATA[Populating Next Right Pointers in Each Node and II[LeetCode]]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/22473207</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/22473207</guid><author>everthing99</author><pubDate>Sat, 29 Mar 2014 09:12:59 +0800</pubDate><description><![CDATA[Populating Next Right Pointers in Each Node
 

Given a binary tree
    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }


Populate each]]></description><category></category></item><item><title><![CDATA[百度面试题]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/22094047</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/22094047</guid><author>everthing99</author><pubDate>Tue, 25 Mar 2014 20:19:23 +0800</pubDate><description><![CDATA[面的都是JAVA的，以及这些东西的实现机制
1.上来就写：两个有序链表，a中去除b中存在的元素
2. 快排，堆排
3. java 锁
4. java中字符串的连接方法及实现
5. 项目设计模式
6. 数据库 锁机制
7. double表示小数精度问题
8. 数据库查找出一个学校每个班级的前十名]]></description><category></category></item><item><title><![CDATA[网易电面试题]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/22093343</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/22093343</guid><author>everthing99</author><pubDate>Tue, 25 Mar 2014 20:13:18 +0800</pubDate><description><![CDATA[回忆网易电面，主要是c++基础语言，数据结构，设计题
1. const int * ，const * int ，int * const区别；

前面两个是指向的值不能修改，后面一个不能再指向另一个新地址。


2. new  malloc


http://www.cnblogs.com/growup/archive/2011/06/27/2091101.html]]></description><category></category></item><item><title><![CDATA[Multiply Strings[LeetCode]]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/21319689</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/21319689</guid><author>everthing99</author><pubDate>Sun, 16 Mar 2014 10:29:44 +0800</pubDate><description><![CDATA[Given two numbers represented as strings, return multiplication of the numbers as a string.

Note: The numbers can be arbitrarily large and are non-negative.

class Solution {
public:
	string mult]]></description><category></category></item><item><title><![CDATA[Reverse Words in a String[LeetCode]]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/21281131</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/21281131</guid><author>everthing99</author><pubDate>Sat, 15 Mar 2014 13:02:49 +0800</pubDate><description><![CDATA[Given an input string, reverse the string word by word.

For example,
Given s = "the sky is blue",
return "blue is sky the".

Clarification:



What constitutes a word?
A sequence of non-sp]]></description><category></category></item><item><title><![CDATA[Sort List [LeetCode]]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/21280979</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/21280979</guid><author>everthing99</author><pubDate>Sat, 15 Mar 2014 12:53:58 +0800</pubDate><description><![CDATA[Sort a linked list in O(n log n)
 time using constant space complexity.
自己写了快排的想法，不过实现的很蛋疼，加上搜索的了其他的人的想法，总结了基本的3种实现方法
第一种：快排的思想，输出结果一直没问题，提交就提示Time Limit
 Exceeded，调了好久没用，后来参考：http://blog.youkuaiyun.com]]></description><category></category></item><item><title><![CDATA[Merge Two Sorted Lists [LeetCode]]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/21280455</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/21280455</guid><author>everthing99</author><pubDate>Sat, 15 Mar 2014 12:30:41 +0800</pubDate><description><![CDATA[Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
//Definition for singly-linked list.
#include 
using name]]></description><category></category></item><item><title><![CDATA[正则表达式30分钟入门教程]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/20768643</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/20768643</guid><author>everthing99</author><pubDate>Sat, 08 Mar 2014 10:39:59 +0800</pubDate><description><![CDATA[正则表达式30分钟入门教程

版本：v2.31 (2009-4-11) 作者：deerchao 转载请注明来源

目录

跳过目录

本文目标如何使用本教程正则表达式到底是什么东西？入门测试正则表达式元字符字符转义重复字符类分枝条件反义分组后向引用零宽断言负向零宽断言注释贪婪与懒惰处理选项平衡组/递归匹配还有些什么东西没提到联系作者网上的资源及本文参考文献更新纪录

本文目标]]></description><category></category></item><item><title><![CDATA[腾讯技术分享实录：游戏后台开发九问]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/20768531</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/20768531</guid><author>everthing99</author><pubDate>Sat, 08 Mar 2014 10:37:51 +0800</pubDate><description><![CDATA[30日，在上海chinajoy嘉里酒店进行了游戏开发者大会，腾讯游戏的研发部助力总经理聂志明进行了演讲。

他为大家演讲的题目是“游戏后台开发中的九个选择”，他解释，使用这个标题的原因，是因为我们在生活中总会遇到很多选择，这个道理同样适用在游戏开发中。原文请见：http://games.qq.com/a/20110730/000379.htm



第一，选择什么样的架构。


]]></description><category></category></item><item><title><![CDATA[为什么要用Ant?]]></title><link>https://blog.youkuaiyun.com/everthing99/article/details/20541007</link><guid>https://blog.youkuaiyun.com/everthing99/article/details/20541007</guid><author>everthing99</author><pubDate>Wed, 05 Mar 2014 13:42:27 +0800</pubDate><description><![CDATA[这是Ant的作者James Duncan Davidson的解释:"我尝试了许多方法来编写一个make文件,从而对于需要重编译的工程,使得其中的所有源文件一次即传递给javac.但是,无论我怎样努力,无论我采用了多少种Make向导工具,仍然无法得到一种能够在多个平台上采用同一方式工作的方法.make文件中的!&#$%#制表符格式实在令我太厌烦了.即便我是Emacs的忠实支持者,我仍然无法忍受一个工]]></description><category></category></item></channel></rss>