<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[surbeyond的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/surbeyond</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; surbeyond]]></copyright><item><title><![CDATA[Disruptor]]></title><link>https://blog.youkuaiyun.com/surbeyond/article/details/70837629</link><guid>https://blog.youkuaiyun.com/surbeyond/article/details/70837629</guid><author>surbeyond</author><pubDate>Thu, 27 Apr 2017 08:41:32 +0800</pubDate><description><![CDATA[Disruptor
 
1. 背景
在给Lancer用户开发第三方SDK时，发现当用户使用SDK在一段很短的时间内发送大量数据到Lancer的接收端时，如果使用Logback的AsyncAppender会存在数据丢失的情况，当切换到LogIeventDisruptor则不会出现这种情况，数据交互非常顺利。其中AsyncAppender底层使用的是ArrayBlockingQueue，Disr]]></description><category></category></item><item><title><![CDATA[hive-udaf GroupConcat]]></title><link>https://blog.youkuaiyun.com/surbeyond/article/details/54946125</link><guid>https://blog.youkuaiyun.com/surbeyond/article/details/54946125</guid><author>surbeyond</author><pubDate>Thu, 09 Feb 2017 12:59:29 +0800</pubDate><description><![CDATA[package me.hadoop.hive.udaf;

import org.apache.hadoop.hive.ql.exec.Description;
import org.apache.hadoop.hive.ql.exec.UDFArgumentException;
import org.apache.hadoop.hive.ql.exec.UDFArgumentLengthExce]]></description><category></category></item><item><title><![CDATA[leetcode-214. Shortest Palindrome]]></title><link>https://blog.youkuaiyun.com/surbeyond/article/details/54581383</link><guid>https://blog.youkuaiyun.com/surbeyond/article/details/54581383</guid><author>surbeyond</author><pubDate>Tue, 17 Jan 2017 11:19:18 +0800</pubDate><description><![CDATA[题目链接：点击打开链接


解：
从左向右遍历，根据回文串的特点向两边展开，取最短的回文串。




代码C++：
#include 
#include 
#include 

using namespace std;
    string shortestPalindrome(string s) {
        int len = s.length();
        ]]></description><category></category></item><item><title><![CDATA[并查集-路径压缩]]></title><link>https://blog.youkuaiyun.com/surbeyond/article/details/54561541</link><guid>https://blog.youkuaiyun.com/surbeyond/article/details/54561541</guid><author>surbeyond</author><pubDate>Sun, 15 Jan 2017 13:15:42 +0800</pubDate><description><![CDATA[并查集的作用：
判断两个子图是否连接
代码C++：
#include 
using namespace std;

const int N = 10;
const int E = 15;

bool isVetexConnect(int *a, int i, int j){
    while(a[i] != i){
        i = a[i];
    }
    while(a[j]]></description><category></category></item><item><title><![CDATA[leetcode-115. Distinct Subsequences]]></title><link>https://blog.youkuaiyun.com/surbeyond/article/details/54408630</link><guid>https://blog.youkuaiyun.com/surbeyond/article/details/54408630</guid><author>surbeyond</author><pubDate>Fri, 13 Jan 2017 14:55:08 +0800</pubDate><description><![CDATA[题目链接：点击打开链接
解：




代码C++:
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

const int N = 10000;
int table[N][N] = {0};

int numDistinct(string s, stri]]></description><category></category></item><item><title><![CDATA[leetcode-300. Longest Increasing Subsequence]]></title><link>https://blog.youkuaiyun.com/surbeyond/article/details/54408267</link><guid>https://blog.youkuaiyun.com/surbeyond/article/details/54408267</guid><author>surbeyond</author><pubDate>Fri, 13 Jan 2017 14:27:25 +0800</pubDate><description><![CDATA[题目链接：点击打开链接
解：
最优子结构 


代码C++:

#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;


const int N = 10000;
int table[N][N] = {0};


int lengthOfLIS(vector]]></description><category></category></item><item><title><![CDATA[leetcode-5. Longest Palindromic Substring]]></title><link>https://blog.youkuaiyun.com/surbeyond/article/details/54408183</link><guid>https://blog.youkuaiyun.com/surbeyond/article/details/54408183</guid><author>surbeyond</author><pubDate>Fri, 13 Jan 2017 14:19:50 +0800</pubDate><description><![CDATA[题目链接：点击打开链接
解：




代码 C++：
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

const int N = 1000;
int table[N][N] = {0};

string longestPalindrome(strin]]></description><category></category></item></channel></rss>