<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_37698164的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_37698164</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_37698164]]></copyright><item><title><![CDATA[动态链接库：So、dll、dylib的区别]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/128316765</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/128316765</guid><author>m0_37698164</author><pubDate>Wed, 14 Dec 2022 15:37:28 +0800</pubDate><description><![CDATA[so、dll、dylib有什么区别？go如何使用so、dylib、dll？]]></description><category></category></item><item><title><![CDATA[数据库：Mysql性能优化 Explain使用]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/128131183</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/128131183</guid><author>m0_37698164</author><pubDate>Thu, 01 Dec 2022 14:32:26 +0800</pubDate><description><![CDATA[Mysql性能优化 Explain使用。]]></description><category></category></item><item><title><![CDATA[自我管理的重要模型]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/128121931</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/128121931</guid><author>m0_37698164</author><pubDate>Wed, 30 Nov 2022 23:39:02 +0800</pubDate><description><![CDATA[自我管理贯穿整个人一生，学会自我管理是成功的重中之重，那么到底是时间管理还是精力管理？]]></description><category></category></item><item><title><![CDATA[消息队列：Kafka入门学习笔记]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/128034569</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/128034569</guid><author>m0_37698164</author><pubDate>Fri, 25 Nov 2022 13:18:48 +0800</pubDate><description><![CDATA[主流消息队列中，kafka和nsq消息队列的start数量遥遥领先。]]></description><category></category></item><item><title><![CDATA[JVM、JRE、JDK、JAVA、Javac等术语的联系]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/128015257</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/128015257</guid><author>m0_37698164</author><pubDate>Thu, 24 Nov 2022 14:07:38 +0800</pubDate><description><![CDATA[JVM、JRE、JDK、JAVA、Javac等java术语之间的关系]]></description><category></category></item><item><title><![CDATA[计算机系统：Linux/windows查看硬件支持的最大内存]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127967868</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127967868</guid><author>m0_37698164</author><pubDate>Mon, 21 Nov 2022 16:43:58 +0800</pubDate><description><![CDATA[Linux/windows查看硬件支持的最大内存。]]></description><category></category></item><item><title><![CDATA[编程模式：Go编程pipeline模式]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127947195</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127947195</guid><author>m0_37698164</author><pubDate>Sun, 20 Nov 2022 12:29:15 +0800</pubDate><description><![CDATA[什么是pipeline模式是一种把各种命令拼接起来完成一个更强功能的技术方法。Linux 进程间基本的通信方式主要有：管道(pipe) (包括匿名管道和命名管道)、信号(signal)、消息队列(queue)、共享内存、信号量和套接字。Pipeline就是其中一种通信方式。提示：以下是本篇文章正文内容，下面案例可供参考现在的流式处理、函数式编程、应用网关对微服务进行简单的 API 编排，其实都是受 Pipeline 这种技术方式的影响。]]></description><category></category></item><item><title><![CDATA[Go性能优化：sync包的使用]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127921471</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127921471</guid><author>m0_37698164</author><pubDate>Fri, 18 Nov 2022 18:03:16 +0800</pubDate><description><![CDATA[golang性能优化, sync.pool提高内存分配的效率，减少GC压力]]></description><category></category></item><item><title><![CDATA[Golang：基于go反射机制实现通用http参数与结构体的转换]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127904724</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127904724</guid><author>m0_37698164</author><pubDate>Thu, 17 Nov 2022 16:35:17 +0800</pubDate><description><![CDATA[基于Go反射机制实现通用的http参数与结构体的转化，可以用于参数绑定，写成中间件模式，不需要每次都需要写一个参数解析功能。减少重复劳动]]></description><category></category></item><item><title><![CDATA[Golang：Go1.18泛型使用详解]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127860464</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127860464</guid><author>m0_37698164</author><pubDate>Tue, 15 Nov 2022 13:04:57 +0800</pubDate><description><![CDATA[Go1.18开始支持泛型，主要有6个特点，下面给大家一个个详解]]></description><category></category></item><item><title><![CDATA[系统设计：什么是康威四定律？]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127854144</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127854144</guid><author>m0_37698164</author><pubDate>Mon, 14 Nov 2022 19:55:45 +0800</pubDate><description><![CDATA[系统架构设计康威四定律是什么？]]></description><category></category></item><item><title><![CDATA[CMake、Make、MinGw、Clang、Llvm、GCC、MSVC的区别]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127811508</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127811508</guid><author>m0_37698164</author><pubDate>Fri, 11 Nov 2022 19:40:21 +0800</pubDate><description><![CDATA[除开 GCC (GNU 编译器集合) 以外，MinGW 还包含有一些其他的 GNU 程序开发工具；的缩写，MinGw是windows版本的gcc集合。并不仅是一个 C/C++ 编译器，而是一套。是微软开发的VC运行时库，3、Make和CMake是。]]></description><category></category></item><item><title><![CDATA[动态规划：买卖股票的最佳时机 LeetCode.121]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127779941</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127779941</guid><author>m0_37698164</author><pubDate>Thu, 10 Nov 2022 23:15:38 +0800</pubDate><description><![CDATA[经典动态规划题目，买卖股票的最佳时机，一共6道题]]></description><category></category></item><item><title><![CDATA[C++：gcc和g++的区别]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127795370</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127795370</guid><author>m0_37698164</author><pubDate>Thu, 10 Nov 2022 20:24:07 +0800</pubDate><description><![CDATA[大GCC是GUN编辑器集合，小gcc是C编译器，小g++是C++编译器]]></description><category></category></item><item><title><![CDATA[Go微服务框架：Go-Kratos学习笔记]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127791281</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127791281</guid><author>m0_37698164</author><pubDate>Thu, 10 Nov 2022 17:09:28 +0800</pubDate><description><![CDATA[Kratos是一门轻量级go微服务框架，吧我当年的入门学习笔记贡献给入门的同学参考]]></description><category></category></item><item><title><![CDATA[Utools 提高编程效率的工具集,号称小工具之王]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127790535</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127790535</guid><author>m0_37698164</author><pubDate>Thu, 10 Nov 2022 16:04:44 +0800</pubDate><description><![CDATA[Utools 号称小工具之王, 提高程序员或者任何使用电脑的人办公效率的工具集.]]></description><category></category></item><item><title><![CDATA[Linux下如何使用 fc 命令]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127769050</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127769050</guid><author>m0_37698164</author><pubDate>Wed, 09 Nov 2022 14:49:50 +0800</pubDate><description><![CDATA[fc 命令主要类似history命令，但多了编辑功能。]]></description><category></category></item><item><title><![CDATA[动态规划：什么是动态规划？]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127760143</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127760143</guid><author>m0_37698164</author><pubDate>Tue, 08 Nov 2022 22:20:26 +0800</pubDate><description><![CDATA[动态规划是一种算法思想：一种将原问题分解成子问题来求解的思想；]]></description><category></category></item><item><title><![CDATA[【动态规划：三角形最小路径和 LeetCode 120】]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127718235</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127718235</guid><author>m0_37698164</author><pubDate>Sun, 06 Nov 2022 17:51:48 +0800</pubDate><description><![CDATA[每一步只能移动到下一行中相邻的结点上。相邻的结点 在这里指的是 下标 与 上一层结点下标 相同或者等于 上一层结点下标 + 1 的两个结点。也就是说，如果正位于当前行的下标 i ，那么下一步可以移动到下一行的下标 i 或 i + 1。给定一个三角形 triangle ，找出自顶向下的最小路径和。因此，此题的核心代码是。]]></description><category></category></item><item><title><![CDATA[【动态规划：最小路径和 LeetCode 64】]]></title><link>https://blog.youkuaiyun.com/m0_37698164/article/details/127715041</link><guid>https://blog.youkuaiyun.com/m0_37698164/article/details/127715041</guid><author>m0_37698164</author><pubDate>Sun, 06 Nov 2022 15:03:56 +0800</pubDate><description><![CDATA[给定一个包含非负整数的 m x n 网格 grid ，请找出一条从左上角到右下角的路径，使得路径上的数字总和为最小。说明：一个机器人每次只能。]]></description><category></category></item></channel></rss>