<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[L__xing的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/L__xing</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; L__xing]]></copyright><item><title><![CDATA[leetcode—二叉树的最近公共祖先]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/112848081</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/112848081</guid><author>L__xing</author><pubDate>Tue, 19 Jan 2021 17:30:59 +0800</pubDate><description><![CDATA[解法思路：

1.利用后序遍历逐步根节点遍历

2.遍历时当前节点存在两种情况：

  a.当前节点的左右子树中包含目标节点，则当前节点就是最近的公共祖先节点

b.当前节点是目标节点之一，且当前节点的子节点中包含了目标节点，那公共祖先节点就是该节点

解法一：递归


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeN...]]></description><category></category></item><item><title><![CDATA[leetcode—二叉树中的最大路径和]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/112793710</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/112793710</guid><author>L__xing</author><pubDate>Mon, 18 Jan 2021 20:01:01 +0800</pubDate><description><![CDATA[/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *.]]></description><category></category></item><item><title><![CDATA[leetcode-k个一组翻转链表]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/112545317</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/112545317</guid><author>L__xing</author><pubDate>Tue, 12 Jan 2021 19:30:37 +0800</pubDate><description><![CDATA[之前在做这道题时在评论里发现了一道大神的做法，觉得很精妙，特此记录一下


/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x]]></description><category></category></item><item><title><![CDATA[redis集合]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/111995641</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/111995641</guid><author>L__xing</author><pubDate>Wed, 30 Dec 2020 17:52:46 +0800</pubDate><description><![CDATA[Redis集合底层实现是哈希表或整数数组，如下图所示


127.0.0.1:6379&gt; SADD names "lxx" "xuming"
(integer) 2
127.0.0.1:6379&gt; object encoding names
"hashtable"



127.0.0.1:6379&gt; SADD ages 11 12 13
(integer) 3
127.0.0.1:6379&gt; smembers ages
1) "11"
2) "12"
3) "13"
127.0.0]]></description><category></category></item><item><title><![CDATA[redis—skiplist]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/111354729</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/111354729</guid><author>L__xing</author><pubDate>Mon, 21 Dec 2020 11:10:26 +0800</pubDate><description><![CDATA[跳表数据结构：

跳表节点


/* ZSETs use a specialized version of Skiplists */
/*
 * 跳跃表节点
 */
typedef struct zskiplistNode {

    // 成员对象
    robj *obj;

    // 分值
    double score;

    // 后退指针
    struct zskiplistNode *backward;

    // 层
    struct zskiplistLevel ]]></description><category></category></item><item><title><![CDATA[oslo_service]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/111246900</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/111246900</guid><author>L__xing</author><pubDate>Thu, 17 Dec 2020 11:24:03 +0800</pubDate><description><![CDATA[Service类：


class Services(object):

    def __init__(self, restart_method='reload'):
        if restart_method not in _LAUNCHER_RESTART_METHODS:
            raise ValueError(_("Invalid restart_method: %s") % restart_method)
        self.restart_method = r]]></description><category></category></item><item><title><![CDATA[oslo_cache解析]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/111046493</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/111046493</guid><author>L__xing</author><pubDate>Fri, 11 Dec 2020 17:55:12 +0800</pubDate><description><![CDATA[oslo_cache主要依赖于dogpile.cache库

oslo.cache缓存机制的核心实现都定义在oslo_cache.core模块中，而缓存机制的实现主要依赖于以下几个方法：

create_region(function=function_key_generator)：创建缓存区，该方法主要调用了dogpile.cache模块的make_region(function_key_generator=function)方法创建了一个CacheRegion对象。
	configure_cache_r]]></description><category></category></item><item><title><![CDATA[redis—rehash]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/110957198</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/110957198</guid><author>L__xing</author><pubDate>Thu, 10 Dec 2020 23:06:51 +0800</pubDate><description><![CDATA[int dictRehash(dict *d, int n) {

    // 只可以在 rehash 进行中时执行
    if (!dictIsRehashing(d)) return 0;

    // 进行 N 步迁移
    // T = O(N)
    while(n--) {
        dictEntry *de, *nextde;

        /* Check if we already rehashed the whole table... */
        // .]]></description><category></category></item><item><title><![CDATA[redis源码阅读—SDS空间预分配策略和惰性删除策略]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/110949835</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/110949835</guid><author>L__xing</author><pubDate>Thu, 10 Dec 2020 11:47:54 +0800</pubDate><description><![CDATA[备注：文中redis源码版本为redis3.0

该段摘自于《redis设计与实现》

空间预分配用于优化 SDS 的字符串增长操作： 当 SDS 的 API 对一个 SDS 进行修改， 并且需要对 SDS 进行空间扩展的时候， 程序不仅会为 SDS 分配修改所必须要的空间， 还会为 SDS 分配额外的未使用空间。

其中， 额外分配的未使用空间数量由以下公式决定：

如果对 SDS 进行修改之后， SDS 的长度（也即是len属性的值）将小于1MB， 那么程序分配和len属性同样大小的未使用...]]></description><category></category></item><item><title><![CDATA[redis源码阅读—SDS阅读札记]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/110939016</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/110939016</guid><author>L__xing</author><pubDate>Wed, 09 Dec 2020 19:37:31 +0800</pubDate><description><![CDATA[阅读SDS数据结构实现时，发现如下代码
struct sdshdr *sh = (void*)(s-(sizeof(struct sdshdr)));
]]></description><category></category></item><item><title><![CDATA[python下判断一个集合是否为另一个集合的子集的两种方法]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/110490580</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/110490580</guid><author>L__xing</author><pubDate>Wed, 02 Dec 2020 17:52:13 +0800</pubDate><description><![CDATA[文章概要：

1.判断集合子集的两种方法

2.python中issubset函数的源码实现

通常判断集合的子集一般都是使用issubset，但是今天在看到一段代码：判断一个权限列表是否为另一个权限列表的子集时看到用到了相减的方法，感觉很有意思，所以做个记录


x = {3, 4}
y = {3, 4, 5, 6}


if 0 == len(x - y):
    print "true"
else:
    print "False"

if x.issubset(y):
    print "tr]]></description><category></category></item><item><title><![CDATA[从keystone的dependency模块源码解析看依赖注入技术]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/110442236</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/110442236</guid><author>L__xing</author><pubDate>Tue, 01 Dec 2020 20:51:54 +0800</pubDate><description><![CDATA[在keystone中可以经常看到controllers.py文件下有如下装饰器的使用：

@dependency.requires（‘name’）


@dependency.requires('assignment_api', 'catalog_api', 'identity_api',
                     'resource_api', 'token_provider_api', 'trust_api')
class Auth(controller.V3Controller):

]]></description><category></category></item><item><title><![CDATA[oslo_messaging源码阅读(2)—RPCServer]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/110088908</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/110088908</guid><author>L__xing</author><pubDate>Tue, 24 Nov 2020 17:42:30 +0800</pubDate><description><![CDATA[大概的调用流程图，还有很多细节并未在图中画出，后续针对各个细节介绍

1.dispatcher

2.GreenThreadPoolExecutor







未完待续。。。。。。。
]]></description><category></category></item><item><title><![CDATA[oslo_messaging源码阅读(1)—RPCClient]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/109773521</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/109773521</guid><author>L__xing</author><pubDate>Wed, 18 Nov 2020 14:45:34 +0800</pubDate><description><![CDATA[本文主要分析使用oslo_messaging时，RPCClient的获取及发送消息流程

还需要补充的地方：

1.setevedore加载自定义插件方法

2.具体的driver发送消息send流程

这里只是简单给出了一个大致流程，还有很多地方需要补充







未完待续。。。。。。。
...]]></description><category></category></item><item><title><![CDATA[每日一题之跳跃游戏]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/109759535</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/109759535</guid><author>L__xing</author><pubDate>Wed, 18 Nov 2020 00:20:39 +0800</pubDate><description><![CDATA[leetcode55.跳跃游戏

Answers 1:


class Solution {
public:
    bool canJump(vector&lt;int&gt;&amp; nums) {
        //题解思路：
        //  遍历数组，但是遍历的范围是由数组位置上的值决定的
        //使用一个值ret不断的记录更新当前可跳跃的最远距离，在这段距离内通过当前位置和该位置上标示
        //的值进行判断是否可以到达数组的末尾

        int le.]]></description><category></category></item><item><title><![CDATA[个人练习之二叉树的前序遍历]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/109733812</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/109733812</guid><author>L__xing</author><pubDate>Tue, 17 Nov 2020 00:39:14 +0800</pubDate><description><![CDATA[leet_code.二叉树的前序遍历

Answer 1:使用栈


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), l]]></description><category></category></item><item><title><![CDATA[个人练习之二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/109733595</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/109733595</guid><author>L__xing</author><pubDate>Tue, 17 Nov 2020 00:23:01 +0800</pubDate><description><![CDATA[leet_code94.二叉树的中序遍历

Answer 1:非递归


/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x),]]></description><category></category></item><item><title><![CDATA[个人练习之二叉树的层序遍历]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/109732550</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/109732550</guid><author>L__xing</author><pubDate>Mon, 16 Nov 2020 23:15:25 +0800</pubDate><description><![CDATA[leet_code94.二叉树的层序遍历

Answer 1:使用队列


class Solution {
public:
    vector&lt;vector&lt;int&gt;&gt; levelOrder(TreeNode* root) {
        vector&lt;vector&lt;int&gt;&gt; result;
        if(!root)
            return result;

        queue&lt;TreeNode*&gt; q1;]]></description><category></category></item><item><title><![CDATA[浅析平衡搜索树之——红黑树]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/80369065</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/80369065</guid><author>L__xing</author><pubDate>Sat, 19 May 2018 10:49:45 +0800</pubDate><description><![CDATA[红黑树概念红黑树是一棵二叉搜索树，它在每个节点上增加了一个存储位来表示节点的颜色，可以是Red或Black。通过对任何一条从根到叶子简单路径上的颜色来约束，红黑树保证最长路径不超过最短路径的两倍，因而近似于平衡。特性如下：1. 每个节点，不是红色就是黑色的2. 根节点是黑色的3. 如果一个节点是红色的，则它的两个子节点是黑色的4. 对每个节点，从该节点到其所有后代叶节点的简单路径上，均包含相同数目...]]></description><category></category></item><item><title><![CDATA[Linux下的load average]]></title><link>https://blog.youkuaiyun.com/L__xing/article/details/80364961</link><guid>https://blog.youkuaiyun.com/L__xing/article/details/80364961</guid><author>L__xing</author><pubDate>Fri, 18 May 2018 17:08:13 +0800</pubDate><description><![CDATA[在Linux中，当我们使用top命令或uptime命令时，都会发现一个这样的字段：load averageload average后面三个数字分别代表不同时间段即一分钟、五分钟和十五分钟的系统平均负载。当然我们还可以在/proc下查看:cat /proc/loadavg第四个值的分子是正在运行的进程数，分母为总进程数；第五个值是最近运行的进程id；什么是系统平均负载？Linux下，系统平均负载指的...]]></description><category></category></item></channel></rss>