<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[To be what you what to be!]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u010228612</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u010228612]]></copyright><item><title><![CDATA[storm集群搭建]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/78916240</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/78916240</guid><author>u010228612</author><pubDate>Wed, 27 Dec 2017 21:12:52 +0800</pubDate><description><![CDATA[可参考：
http://aperise.iteye.com/blog/2295227
或者极客学院
http://www.jikexueyuan.com/course/724.html



极客学院讲解的较为详细，我使用三台虚拟机搭建环境，在搭建过程中主要遇到的问题总结一下：
1.zookeeper启动不了。
检查每台机器zkdata目录下是否设置了myid。
检查端口是否被]]></description><category></category></item><item><title><![CDATA[leetcode  76. Minimum Window Substring]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/66474074</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/66474074</guid><author>u010228612</author><pubDate>Sun, 26 Mar 2017 13:05:19 +0800</pubDate><description><![CDATA[76. Minimum Window Substring


Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).

For example,
S = "ADOBECODEBANC"
T =]]></description><category></category></item><item><title><![CDATA[leetcode 456. 132 Pattern]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/66472818</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/66472818</guid><author>u010228612</author><pubDate>Sun, 26 Mar 2017 11:19:25 +0800</pubDate><description><![CDATA[456. 132 Pattern


Given a sequence of n integers a1, a2,
 ..., an, a 132 pattern is a subsequence ai,
 aj, ak such
 that i j k and ai <
 ak j.
 Design an algorithm that takes a list of n numb]]></description><category></category></item><item><title><![CDATA[leetcode 432. All O`one Data Structure]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/66472784</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/66472784</guid><author>u010228612</author><pubDate>Sun, 26 Mar 2017 11:14:45 +0800</pubDate><description><![CDATA[432. All O`one Data Structure


Implement a data structure supporting the following operations:



Inc(Key) - Inserts a new key with value 1. Or increments an existing key by 1. Key is guarante]]></description><category></category></item><item><title><![CDATA[leetcode 146. LRU Cache 460. LFU Cache]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/62242071</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/62242071</guid><author>u010228612</author><pubDate>Wed, 15 Mar 2017 23:05:45 +0800</pubDate><description><![CDATA[146. LRU Cache


Design and implement a data structure for Least Recently Used (LRU) cache.
 It should support the following operations: get and put.

get(key) - Get the value (will always be po]]></description><category></category></item><item><title><![CDATA[leetcode 4. Median of Two Sorted Arrays]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/61616358</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/61616358</guid><author>u010228612</author><pubDate>Sun, 12 Mar 2017 13:25:56 +0800</pubDate><description><![CDATA[There are two sorted arrays nums1 and nums2 of size m and n respectively.

Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

Example 1:

nums1 =]]></description><category></category></item><item><title><![CDATA[Kickstart Round A 2017 Problem A. Square Counting Problem B. Patterns Overlap]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/60477462</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/60477462</guid><author>u010228612</author><pubDate>Sun, 05 Mar 2017 22:07:04 +0800</pubDate><description><![CDATA[感想：
Kickstart Round A小计，第一次打Kickstart，据说是进google的必经之路，难度确实还比较难，更可怕的是前面厉害的人太多，第三题是计算几何碰都没怎么碰过的题，AK的人还是那么多= =，可见进google是有多么大的竞争。比赛时只能做出A和b的small，比赛完后想想B的big也是可以做的，然后就做了。

ps：第一次打这个比赛，有些规则不是很清楚，原来每次给出]]></description><category></category></item><item><title><![CDATA[leetcode 两道交换问题]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/54311944</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/54311944</guid><author>u010228612</author><pubDate>Tue, 10 Jan 2017 11:18:30 +0800</pubDate><description><![CDATA[41. First Missing Positive


Given an unsorted integer array, find the first missing positive integer.

For example,
Given [1,2,0] return 3,
and [3,4,-1,1] return 2.

Your algorithm should ru]]></description><category></category></item><item><title><![CDATA[hadoop环境配置 windows+eclipse]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/52751893</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/52751893</guid><author>u010228612</author><pubDate>Mon, 10 Oct 2016 19:22:10 +0800</pubDate><description><![CDATA[hadoop安装参考给力星
我安装的版本是2.7.0
在linux下开发会有一些不方便，非mac档只能尝试在win上远程连接了，幸好有大神写了eclipse的hadoop插件，并且支持远程连接，于是来折腾这一环境。
插件安装还是参考给力星
由于他的文章是给出的linux+eclipse，改成windos需要将localhost换成linux机器的ip即可，注意hadoop环境的配置文件co]]></description><category></category></item><item><title><![CDATA[Ubuntu下添加开机启动脚本（转载）]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/52526895</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/52526895</guid><author>u010228612</author><pubDate>Tue, 13 Sep 2016 16:16:00 +0800</pubDate><description><![CDATA[转载于王恒's Blog


1、方法一，编辑rc.loacl脚本 

Ubuntu开机之后会执行/etc/rc.local文件中的脚本，

所以我们可以直接在/etc/rc.local中添加启动脚本。

当然要添加到语句：exit 0 前面才行。

如：

sudo vi /etc/rc.local

然后在 exit 0 前面添加好脚本代码。

 2、方法二，]]></description><category></category></item><item><title><![CDATA[python numpy笔记]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/52403121</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/52403121</guid><author>u010228612</author><pubDate>Thu, 01 Sep 2016 20:25:31 +0800</pubDate><description><![CDATA[numpy笔记，包含常用操作，参考http://www.dataivy.cn/blog/python基础数据处理库-numpy/


import numpy as np 

#创建create
arr=np.arange(1,13,1) #开始值  终值（不包括）步长
print arr
print np.linspace(1,13,8) #开始值  终值（包括）步长 个数    形成等差]]></description><category></category></item><item><title><![CDATA[递归转循环的通用方法]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/51180977</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/51180977</guid><author>u010228612</author><pubDate>Mon, 18 Apr 2016 20:49:59 +0800</pubDate><description><![CDATA[1.递归
定义：程序调用自身的编程技巧称为递归。
栈与递归的关系：递归是借助于系统栈来实现的。每次递归调用，系统都要为该次调用分配一系列的栈空间用于存放此次调用的相关信息：返回地址，局部变量等。当调用完成时，就从栈空间内释放这些单元，在该函数没有完成前，分配的这些单元将一直保存着不被释放。



2.递归转化为循环
记得有人说过“所有递归都能转化为循环”，某晚睡不着思考了一下这个问题]]></description><category></category></item><item><title><![CDATA[phpExcel实现表格之间的转换]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/51018944</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/51018944</guid><author>u010228612</author><pubDate>Wed, 30 Mar 2016 21:53:05 +0800</pubDate><description><![CDATA[1.问题描述
现在有一个总表staff.xls，每一行代表一个人的数据，要求将该表转换为若干个表people.xls，每一个人为一个表。或者问题反过来，要求将若干个表汇总。



2.思路

将问题简单化，仔细想想，也就几个步骤：


（0）我们知道staff.xls和people.xls的格式布局，有两个这样的模板文件，知道两个表转换时数据是怎样对应的，比如staff的‘BS]]></description><category></category></item><item><title><![CDATA[phpExcel常用方法]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/51019419</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/51019419</guid><author>u010228612</author><pubDate>Wed, 30 Mar 2016 21:17:35 +0800</pubDate><description><![CDATA[include 'PHPExcel.php';
include 'PHPExcel/Writer/Excel2007.php';
//或者include 'PHPExcel/Writer/Excel5.php'; 用于输出.xls的
创建一个excel
$objPHPExcel = new PHPExcel();
保存excel—2007格式
$objWriter = new PHPExcel_W]]></description><category></category></item><item><title><![CDATA[C#编程 井字游戏]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/46883187</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/46883187</guid><author>u010228612</author><pubDate>Tue, 14 Jul 2015 23:13:07 +0800</pubDate><description><![CDATA[一、需求分析
游戏规则：两人轮流下棋，谁先将3颗棋子摆成横竖斜一条直线即获胜。
界面温馨，支持人机对战、双人对战，电脑难度有简单和困难。
二、运行界面]]></description><category></category></item><item><title><![CDATA[网页抓取信息（php正则表达式、php操作excel）]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/46419725</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/46419725</guid><author>u010228612</author><pubDate>Mon, 08 Jun 2015 23:46:07 +0800</pubDate><description><![CDATA[1.问题描述
实现对固定网页上自己需要的信息抓取，以表格形式存储。我是拿wustoj上的一个排行榜来练习的，地址：wustoj


2.思路
网页自己就简单学习了一下php，刚好用它来做点事情吧，我的想法是这样的：
（1）查看网页源代码并保存在文件中。
（2）根据需要的信息写出正则表达式，读文件，根据正则表达式来提取需要的信息。写正则表达式的时候最好分组，这样提取起来就方便了很多。]]></description><category></category></item><item><title><![CDATA[poj  3691 DNA repair（AC自动机+dp）]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/46405305</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/46405305</guid><author>u010228612</author><pubDate>Sun, 07 Jun 2015 22:54:47 +0800</pubDate><description><![CDATA[DNA repair




Time Limit: 2000MS
 
Memory Limit: 65536K


Total Submissions: 5877
 
Accepted: 2760




Description

Biologists finally invent techniques of repairing DNA that conta]]></description><category></category></item><item><title><![CDATA[hdu 2222 Keywords Search（AC自动机入门）]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/46405065</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/46405065</guid><author>u010228612</author><pubDate>Sun, 07 Jun 2015 22:41:31 +0800</pubDate><description><![CDATA[Keywords Search

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 42138    Accepted Submission(s): 13289


Problem Description
In the m]]></description><category></category></item><item><title><![CDATA[LightOJ 1356  Prime Independence  (素数 二分图)]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/46318599</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/46318599</guid><author>u010228612</author><pubDate>Mon, 01 Jun 2015 23:38:53 +0800</pubDate><description><![CDATA[Prime Independence

Time Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu
Submit Status Practice LightOJ
 1356



Description

A set of integers is called prime independ]]></description><category></category></item><item><title><![CDATA[whu oj 1579 - Big data]]></title><link>https://blog.youkuaiyun.com/u010228612/article/details/45933097</link><guid>https://blog.youkuaiyun.com/u010228612/article/details/45933097</guid><author>u010228612</author><pubDate>Sat, 23 May 2015 11:27:08 +0800</pubDate><description><![CDATA[Problem 1579 - Big data 

Time Limit: 1000MS   Memory Limit: 65536KB   

Total Submit: 73  Accepted: 12  Special Judge: No


Description

The data scientists of CVTE declared that they had di]]></description><category></category></item></channel></rss>