<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Liberalspirit的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Liberalspirit</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Liberalspirit]]></copyright><item><title><![CDATA[leetcode12]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/120414194</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/120414194</guid><author>Liberalspirit</author><pubDate>Wed, 22 Sep 2021 14:36:06 +0800</pubDate><description><![CDATA[// 注意位置是在class 的外部
// unordered_map的内部顺序可能和初始化的时候不一样
const pair&lt;int, string&gt; hmap[] = {
       {1000, "M"},
       {900, "CM"},
       {500, "D"},
       {400, "CD"},
       {100, "C"},
       {90, "XC"},
       {50, "L"},
       {40, "XL"},
       .]]></description><category></category></item><item><title><![CDATA[leetcode 9]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/120402187</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/120402187</guid><author>Liberalspirit</author><pubDate>Tue, 21 Sep 2021 15:45:48 +0800</pubDate><description><![CDATA[//1.常规方法
class Solution {
public:
    int isPalindrome(int x) {
        int temp=x;
        if(x&lt;0) return false;
        int reverse=0;
        while(x){
            //overflow
            if(reverse&gt;INT_MAX/10)return false;
            int digit=x.]]></description><category></category></item><item><title><![CDATA[leetcode 5]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/120356625</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/120356625</guid><author>Liberalspirit</author><pubDate>Sat, 18 Sep 2021 10:39:01 +0800</pubDate><description><![CDATA[//第一种方法：动态规划dp
class Solution {
public:
    string longestPalindrome(string s) {
        int n=s.length();//s的长度 0-n-1
        if(n&lt;2)return s;//剪枝

        int dp[1005][1005]={0};//设置hash表记录s[i][j]是否是回文串
        // memset(dp,0,sizeof(dp))

        //初.]]></description><category></category></item><item><title><![CDATA[leetcode1-3]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/120330395</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/120330395</guid><author>Liberalspirit</author><pubDate>Thu, 16 Sep 2021 15:44:48 +0800</pubDate><description><![CDATA[//1. 两数之和
//时间复杂度o(n)
class Solution {
public:
    vector&lt;int&gt; twoSum(vector&lt;int&gt;&amp; nums, int target) {
       unordered_map&lt;int,int&gt; hashMap;
       int n=nums.size();
       for(int i=0;i&lt;n;i++){
           auto it=hashMap.find(t.]]></description><category></category></item><item><title><![CDATA[A1108 Finding Average (20 分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/114688448</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/114688448</guid><author>Liberalspirit</author><pubDate>Fri, 12 Mar 2021 20:40:10 +0800</pubDate><description><![CDATA[//主要是解决字符串是否能转换为符合题目要求的数字--逻辑判断就是很常规的分类讨论（好在题目控制输入在小数点后两位）。。具体解释见注释，需要注意的是输出的格式

//注意一下cur++的位置还有cur的范围判断

//最后一个点过不去因为样例会出现 2. 小数点后面没有小数的场景--但其实也是符合条件的

//res的负号要最后乘，在每一次return回正确数据之前进行数字范围的判断！

//吐槽:代码10分钟，debug半小时。。。


#include&lt;iostream&gt;
#include&]]></description><category></category></item><item><title><![CDATA[A1153]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/114320180</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/114320180</guid><author>Liberalspirit</author><pubDate>Wed, 03 Mar 2021 16:11:38 +0800</pubDate><description><![CDATA[记录一下错误：1.NA的条件没有判断 2.只有vector才有resize和sort 3.cin和cout速度较慢，endl换行可以用"\n"代替或者直接使用scanf和printf 3.map里的string只能是string类型而不是char[]

学习到的新方法：1.cmp的写法可以使用三元式子更加简洁。 2.struct结构体元素的可以直接用{member1,member2}直接构造 3.map可以用unordered_map代替加快速度。 4.关于迭代器的循环的新方法 for (auto it..]]></description><category></category></item><item><title><![CDATA[A1123 Is It a Complete AVL Tree (30分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110678392</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110678392</guid><author>Liberalspirit</author><pubDate>Sat, 05 Dec 2020 11:08:24 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include &lt;algorithm&gt;//含有fill()等 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include&lt;map&gt;
#include&lt;vector&gt;
#inclu.]]></description><category></category></item><item><title><![CDATA[甲级A1151 LCA in a Binary Tree (30分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110672666</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110672666</guid><author>Liberalspirit</author><pubDate>Fri, 04 Dec 2020 20:47:40 +0800</pubDate><description><![CDATA[占一个坑，没有想出来是哪个错，还需要优化，因为一个实例超时了。。。




#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include &lt;algorithm&gt;//含有fill()等 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include&lt.]]></description><category></category></item><item><title><![CDATA[A1143 Lowest Common Ancestor (30分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110671748</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110671748</guid><author>Liberalspirit</author><pubDate>Fri, 04 Dec 2020 19:52:23 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include &lt;algorithm&gt;//含有fill()等 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include&lt;map&gt;
#include&lt;vector&gt;
#inclu.]]></description><category></category></item><item><title><![CDATA[A1130 Infix Expression (25分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110648337</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110648337</guid><author>Liberalspirit</author><pubDate>Fri, 04 Dec 2020 15:32:07 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include&lt;map&gt;
#inclu.]]></description><category></category></item><item><title><![CDATA[A1155 Heap Paths (30分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110588800</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110588800</guid><author>Liberalspirit</author><pubDate>Thu, 03 Dec 2020 22:53:02 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include&lt;map&gt;
#inclu.]]></description><category></category></item><item><title><![CDATA[A1147 Heaps (30分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110581169</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110581169</guid><author>Liberalspirit</author><pubDate>Thu, 03 Dec 2020 22:07:12 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include&lt;map&gt;
#inclu.]]></description><category></category></item><item><title><![CDATA[A1140 Look-and-say Sequence (20分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110506629</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110506629</guid><author>Liberalspirit</author><pubDate>Wed, 02 Dec 2020 23:34:26 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include&lt;map&gt;
#inclu.]]></description><category></category></item><item><title><![CDATA[A1139 First Contact (30分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110502157</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110502157</guid><author>Liberalspirit</author><pubDate>Wed, 02 Dec 2020 22:21:59 +0800</pubDate><description><![CDATA[发现暴力的矩阵不太合适，参考柳神的map用法，将矩阵换成使用map存储边的权重（如无权重，存储是否有关系0/1 即可），map&lt;int,int &gt;第一个位置存储转换后的索引（二维索引变一维），后一个位置存储权重

这里多了一个使用vector&lt;int&gt; edge[maxn] 来存储同性的朋友


#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#]]></description><category></category></item><item><title><![CDATA[1138 Postorder Traversal (25分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110455248</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110455248</guid><author>Liberalspirit</author><pubDate>Tue, 01 Dec 2020 22:28:30 +0800</pubDate><description><![CDATA[这题就是很常规。。。就是后序遍历应该可以再优化一下，应该得到第一个数字就可以return了，如果时间允许范围再小一点可能会超时




#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&.]]></description><category></category></item><item><title><![CDATA[1137 Final Grading (25分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110454498</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110454498</guid><author>Liberalspirit</author><pubDate>Tue, 01 Dec 2020 22:03:43 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include&lt;map&gt;
#inclu.]]></description><category></category></item><item><title><![CDATA[1136 A Delayed Palindrome (20分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110451817</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110451817</guid><author>Liberalspirit</author><pubDate>Tue, 01 Dec 2020 20:48:40 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include &lt;cstdlib&gt;//.]]></description><category></category></item><item><title><![CDATA[A1135 Is It A Red-Black Tree (30分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110409409</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110409409</guid><author>Liberalspirit</author><pubDate>Mon, 30 Nov 2020 22:33:39 +0800</pubDate><description><![CDATA[//判断给出的树是否是红黑树：判断方法：全员递归！
//构造树：调用函数：根据先序遍历构造二叉搜索树？由于二叉搜索树的中序遍历是有序的，因此默认就知道了二叉树的先序和中序遍历！
  //也可通过：二叉搜索树的左子树的节点值&lt;根节点&lt;右子树的节点值 直接比较插入来构造（递归）：先取绝对值，如果比根节点小，就插入左子树，相反就插入右子树
  //树的结构：用静态结构？动态结构？(注意指针和引用的使用)：node{int data,node* left,node* righ...]]></description><category></category></item><item><title><![CDATA[A1134 Vertex Cover (25分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110295138</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110295138</guid><author>Liberalspirit</author><pubDate>Sat, 28 Nov 2020 22:30:00 +0800</pubDate><description><![CDATA[1.原先的思路：导致两个例子运行超时


#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#inclu]]></description><category></category></item><item><title><![CDATA[A1133 Splitting A Linked List (25分)]]></title><link>https://blog.youkuaiyun.com/Liberalspirit/article/details/110249716</link><guid>https://blog.youkuaiyun.com/Liberalspirit/article/details/110249716</guid><author>Liberalspirit</author><pubDate>Fri, 27 Nov 2020 23:00:20 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;
#include&lt;string&gt;
#include&lt;iostream&gt;
#include&lt;vector&gt;
#include &lt;algorithm&gt;//fill()在里面 
#include &lt;cmath&gt;
#include&lt;queue&gt;
#include&lt;unordered_set&gt;
#include&lt;set&gt; 
#include &lt;cstdlib&gt;//.]]></description><category></category></item></channel></rss>