<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[shuara的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/shuara</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; shuara]]></copyright><item><title><![CDATA[C++ 类初值]]></title><link>https://blog.youkuaiyun.com/shuara/article/details/105925493</link><guid>https://blog.youkuaiyun.com/shuara/article/details/105925493</guid><author>shuara</author><pubDate>Mon, 04 May 2020 23:23:25 +0800</pubDate><description><![CDATA[1、const 只能在类的初始化列表中进行初始化。


class A{
    const int a;
public：
    A(int data): a(data){}
        ...
};

2、只有const static可以在定义时赋值。


class B{
    const static int a = 2;
        ...
};

3、java

中如果成员域...]]></description><category></category></item><item><title><![CDATA[马拉车（求最长回文字符串）]]></title><link>https://blog.youkuaiyun.com/shuara/article/details/105738093</link><guid>https://blog.youkuaiyun.com/shuara/article/details/105738093</guid><author>shuara</author><pubDate>Fri, 24 Apr 2020 20:16:53 +0800</pubDate><description><![CDATA[参考：https://segmentfault.com/a/1190000008484167

     https://www.bilibili.com/video/BV11E411j7TM

求最长回文字符串

暴力法

    时间复杂度 O()

中心扩展算法

   要分奇数子字符串与偶数子字符串

   时间复杂度 O()


string ...]]></description><category></category></item><item><title><![CDATA[线段树]]></title><link>https://blog.youkuaiyun.com/shuara/article/details/105730021</link><guid>https://blog.youkuaiyun.com/shuara/article/details/105730021</guid><author>shuara</author><pubDate>Fri, 24 Apr 2020 14:25:57 +0800</pubDate><description><![CDATA[参考 ：https://www.bilibili.com/video/BV1cb411t7AM​​​​

 建树


void build_tree(int arr[], int tree[], int node, int start, int end){
	if(start == end){
		tree[node] = arr[start];
		return;
	}
	int mid ...]]></description><category></category></item></channel></rss>