<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[give it a try]]></title><description><![CDATA[花还会开，不同的春来了又来]]></description><link>https://blog.youkuaiyun.com/moasad</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; moasad]]></copyright><item><title><![CDATA[c++减少编译依赖]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/146422497</link><guid>https://blog.youkuaiyun.com/moasad/article/details/146422497</guid><author>moasad</author><pubDate>Fri, 21 Mar 2025 15:49:03 +0800</pubDate><description><![CDATA[查资料的过程中有一句话印象深刻，这里记录下来：教科书上的条条款款和真正的工程实践是有出入的，所以不要纸上谈兵。]]></description><category></category></item><item><title><![CDATA[异常控制流]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/146400576</link><guid>https://blog.youkuaiyun.com/moasad/article/details/146400576</guid><author>moasad</author><pubDate>Thu, 20 Mar 2025 16:31:34 +0800</pubDate><description><![CDATA[x86-64系统中定义的异常 是 CPU 运行过程中意外发生的错误，通常由硬件和软件错误触发，会导致 CPU 进入异常处理程序。这些由CPU赋予异常号这也是异常控制流能被支持的脊柱。]]></description><category></category></item><item><title><![CDATA[报错 undefined reference to `std::__throw_bad_array_new_length()‘]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/138286334</link><guid>https://blog.youkuaiyun.com/moasad/article/details/138286334</guid><author>moasad</author><pubDate>Sun, 28 Apr 2024 18:06:34 +0800</pubDate><description><![CDATA[先说这个错误，，但是自己的cmake中是开启了高版本的c++的。不应该会出现错误，先是怀疑到了protobuf， （因为只要编译它生成的代码就报错），于是拉着grpc一起干掉了（怀疑是当时中间出了问题），删了重新编译。但依然还是有这个错误，于是困惑了几天，一直游走于各种论坛查找问题。]]></description><category></category></item><item><title><![CDATA[python操作csv文件]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/129643670</link><guid>https://blog.youkuaiyun.com/moasad/article/details/129643670</guid><author>moasad</author><pubDate>Sat, 18 Mar 2023 22:06:26 +0800</pubDate><description><![CDATA[row 是一个列表，可以直接下标索引newline防止写入时自动换行writerow写入的是一个列表，]]></description><category></category></item><item><title><![CDATA[C/C++ - 从代码到可执行程序的过程]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128666033</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128666033</guid><author>moasad</author><pubDate>Thu, 12 Jan 2023 20:40:45 +0800</pubDate><description><![CDATA[C/C++ - 从代码到可执行程序的过程]]></description><category></category></item><item><title><![CDATA[C/C++ STL]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128663583</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128663583</guid><author>moasad</author><pubDate>Thu, 12 Jan 2023 17:54:03 +0800</pubDate><description><![CDATA[C/C++ STL]]></description><category></category></item><item><title><![CDATA[面向对象编程三大特性]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128663219</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128663219</guid><author>moasad</author><pubDate>Thu, 12 Jan 2023 17:09:37 +0800</pubDate><description><![CDATA[面向对象编程三大特性]]></description><category></category></item><item><title><![CDATA[C/C++ - new/delete 和malloc/free的区别]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128661696</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128661696</guid><author>moasad</author><pubDate>Thu, 12 Jan 2023 16:22:14 +0800</pubDate><description><![CDATA[C/C++ - new/delete 和malloc/free的区别]]></description><category></category></item><item><title><![CDATA[C/C++ - 引用和指针的区别]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128661569</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128661569</guid><author>moasad</author><pubDate>Thu, 12 Jan 2023 16:04:24 +0800</pubDate><description><![CDATA[C/C++ - 引用和指针的区别]]></description><category></category></item><item><title><![CDATA[C/C++ - 迭代器失效]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128659725</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128659725</guid><author>moasad</author><pubDate>Thu, 12 Jan 2023 15:01:24 +0800</pubDate><description><![CDATA[C/C++ - 迭代器失效]]></description><category></category></item><item><title><![CDATA[计算机网络 - chunk协议]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128592427</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128592427</guid><author>moasad</author><pubDate>Sat, 07 Jan 2023 16:43:29 +0800</pubDate><description><![CDATA[计算机网络 - chunk协议]]></description><category></category></item><item><title><![CDATA[计算机网络-大小端存储]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128589599</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128589599</guid><author>moasad</author><pubDate>Sat, 07 Jan 2023 12:08:52 +0800</pubDate><description><![CDATA[计算机网络-大小端存储]]></description><category></category></item><item><title><![CDATA[计算机网络 - 各种术语对应]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/128589512</link><guid>https://blog.youkuaiyun.com/moasad/article/details/128589512</guid><author>moasad</author><pubDate>Sat, 07 Jan 2023 12:04:58 +0800</pubDate><description><![CDATA[计算机网络-各种术语对应]]></description><category></category></item><item><title><![CDATA[LeetCode 向下的路径节点之和]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/126716002</link><guid>https://blog.youkuaiyun.com/moasad/article/details/126716002</guid><author>moasad</author><pubDate>Tue, 06 Sep 2022 00:08:19 +0800</pubDate><description><![CDATA[LeetCode]]></description><category></category></item><item><title><![CDATA[LeetCode 多余的边]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/126613583</link><guid>https://blog.youkuaiyun.com/moasad/article/details/126613583</guid><author>moasad</author><pubDate>Tue, 30 Aug 2022 21:55:34 +0800</pubDate><description><![CDATA[力扣]]></description><category></category></item><item><title><![CDATA[LeetCode 省份数量]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/126613075</link><guid>https://blog.youkuaiyun.com/moasad/article/details/126613075</guid><author>moasad</author><pubDate>Tue, 30 Aug 2022 21:32:34 +0800</pubDate><description><![CDATA[力扣]]></description><category></category></item><item><title><![CDATA[LeetCode 粉刷房子]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/126580622</link><guid>https://blog.youkuaiyun.com/moasad/article/details/126580622</guid><author>moasad</author><pubDate>Mon, 29 Aug 2022 10:57:30 +0800</pubDate><description><![CDATA[力扣]]></description><category></category></item><item><title><![CDATA[LeetCode 把数组排成最小的数]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/124103275</link><guid>https://blog.youkuaiyun.com/moasad/article/details/124103275</guid><author>moasad</author><pubDate>Mon, 11 Apr 2022 16:49:54 +0800</pubDate><description><![CDATA[详细
class Solution {
public:
    static bool cmp(int a,int b){
        string ab = to_string(a) + to_string(b);
        string ba = to_string(b) + to_string(a);
        return ab &lt; ba;
    }
    string minNumber(vector&lt;int&gt;&amp; nums) {
        so.]]></description><category></category></item><item><title><![CDATA[LeetCode 数字序列中某一位的数字]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/124089004</link><guid>https://blog.youkuaiyun.com/moasad/article/details/124089004</guid><author>moasad</author><pubDate>Mon, 11 Apr 2022 00:02:49 +0800</pubDate><description><![CDATA[详细
先求出这个数的位数有多少，再求出这个数是哪个，再求出这个位置是什么数
class Solution {
public:
    int check(int num,int a){
        string res = "";
        while(num){
            res = res + (char)((num%10) + '0');
            num /= 10;
        }
        reverse(res.begin(),res.end(.]]></description><category></category></item><item><title><![CDATA[LeetCode 最小的k个数]]></title><link>https://blog.youkuaiyun.com/moasad/article/details/124054030</link><guid>https://blog.youkuaiyun.com/moasad/article/details/124054030</guid><author>moasad</author><pubDate>Sat, 09 Apr 2022 00:25:34 +0800</pubDate><description><![CDATA[详细

直接记忆化排序即可
class Solution {
public:
    vector&lt;int&gt; getLeastNumbers(vector&lt;int&gt;&amp; arr, int k) {
        int vis[10005] = {0};
        vector&lt;int&gt; v;
        for(int i = 0;i &lt; arr.size();i++){
            vis[arr[i]]++;
        }
]]></description><category></category></item></channel></rss>