<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[cs学徒的周记]]></title><description><![CDATA[记录一个cs学徒的学习历程]]></description><link>https://blog.youkuaiyun.com/vancooler</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; vancooler]]></copyright><item><title><![CDATA[关于MYSQL left join 的一些细节问题]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/109842989</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/109842989</guid><author>vancooler</author><pubDate>Fri, 20 Nov 2020 11:28:31 +0800</pubDate><description><![CDATA[之前学 mysql 的时候 A left join B 应该是保全 A 表数据如果B表没有则显示 Null， 发现在衔接 where 语句的时候还有一些细节要考虑

因为 where 是最后执行进行筛选，因此如果B表里面没有出去会被过滤掉

即：

如果where的条件和 A相关， 还是会有 B的Null

如果where的条件和B相关， 不会B的null值

解决方式：

在where之前先筛一遍B

方法一. 使用 ON...AND 语句：


SELECT SQL_NO_CACHE platform.]]></description><category></category></item><item><title><![CDATA[关于rabbitmq pika包 reset by peer 的解决方式]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/109001388</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/109001388</guid><author>vancooler</author><pubDate>Sat, 10 Oct 2020 17:57:57 +0800</pubDate><description><![CDATA[写系统的时候要传给另一个模块数据， 直接用了rabbitmq 没用 celery分发， 然后因为对 AMQP 协议不熟在heartbeat 上出了很多问题。

1. heartbeat 不能为 0， 已经设置过，但是可能当时没有内存扩容（这就要说AWS家辣鸡需要自己手动扩容了，否则只有8G存储空间）不知道为什么经常消费者会收不到信息， 怀疑是分配的资源用完了，要么就是丢包自己又不知道，还傻乎乎地等着，又没有 timeout这个让它停下

2. 执行长任务的时候会出问题： 错误：

pika.exceptio]]></description><category></category></item><item><title><![CDATA[2020-09-26]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/108816535</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/108816535</guid><author>vancooler</author><pubDate>Sat, 26 Sep 2020 20:19:47 +0800</pubDate><description><![CDATA[在公司的辣鸡电脑里面装rabbitmq的时候，有时候会需要解决这个问题

问题集中在联想家的电脑

https://blog.youkuaiyun.com/zhm3023/article/details/82217222
]]></description><category></category></item><item><title><![CDATA[django 头部]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/108570806</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/108570806</guid><author>vancooler</author><pubDate>Mon, 14 Sep 2020 00:16:13 +0800</pubDate><description><![CDATA[最近用django 来实现JWT验证的时候发现， 使用django框架提取头部key的时候框架会自己加一些神奇的地方：

如果用 self.request.META:

自己定义的变量会变成

user -&gt; HTTP_USER

user-name -&gt; HTTP_USER_NAME



如果使用self.request.headers

定义的变量会变成

user -&gt; User

user-name -&gt;UserName 双峰命名



因此我关于认证头部的中间件代码会..]]></description><category></category></item><item><title><![CDATA[关于 xpath 中 string(.)的使用方式]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/107931143</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/107931143</guid><author>vancooler</author><pubDate>Tue, 11 Aug 2020 11:14:04 +0800</pubDate><description><![CDATA[可以提取 html element 底下的所有 tag 中的元素的text() 并且帮你拼起来， 这样就不需要用正则先清理一遍标签了。


    import requests                                                               
    r = requests.get("https://kns.cnki.net/KCMS/detail/detail.aspx?dbcode=CJFQ&amp;dbn
    response = r]]></description><category></category></item><item><title><![CDATA[pip 换源记录]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/107223090</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/107223090</guid><author>vancooler</author><pubDate>Thu, 09 Jul 2020 10:50:35 +0800</pubDate><description><![CDATA[简单的临时换一下：

pip install web.py -i http://pypi.douban.com/simple --trusted-host pypi.douban.com

来源：https://www.cnblogs.com/hjbf/p/10645347.html



永久改一下：

https://blog.youkuaiyun.com/innocent_cat/article/details/90481199?utm_medium=distribute.pc_relevant.none-ta.]]></description><category></category></item><item><title><![CDATA[记录一下华为的两次机试：找出有向图中所有的圈并且输出/算合法字符串/计算器]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/104802943</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/104802943</guid><author>vancooler</author><pubDate>Wed, 11 Mar 2020 18:47:04 +0800</pubDate><description><![CDATA[华为的一道机试题目，不知道为什么自己脑子抽了一下想了很久很久（其实主要还是DFS太不熟了

代码也不是很elegant，将就记录一下。


class Node:
    def __init__(self, data, next = None):
        self.data = data
        self.next = next
def dfs(graph, stack, des...]]></description><category></category></item><item><title><![CDATA[9.29 练手 腾讯50题  344.颠倒字符串]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/101722508</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/101722508</guid><author>vancooler</author><pubDate>Sun, 29 Sep 2019 22:52:27 +0800</pubDate><description><![CDATA[Leetcode344.Reverse String


Write a function that reverses a string. The input string is given as an array of characterschar[].

Do not allocate extra space for another array, you must do this by...]]></description><category></category></item><item><title><![CDATA[9.28 练手 腾讯50题　9.回文数 43.字符串数字相乘]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/101635795</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/101635795</guid><author>vancooler</author><pubDate>Sat, 28 Sep 2019 20:24:13 +0800</pubDate><description><![CDATA[Leetcode　9.Palindrome Number

思路是先转换成字符串然后两边双指针检测，代码如下：


class Solution(object):
    def isPalindrome(self, x):
        """
        :type x: int
        :rtype: bool
        """
        if x&lt;0:
 ...]]></description><category></category></item><item><title><![CDATA[9.26 练手 腾讯50题 8.atoi]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/101480722</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/101480722</guid><author>vancooler</author><pubDate>Thu, 26 Sep 2019 22:08:39 +0800</pubDate><description><![CDATA[Leetcode 8.String to Integer (atoi)

如何将字符串转为有效数字题，代码如下：


class Solution(object):
    def myAtoi(self, str):
        """
        :type str: str
        :rtype: int
        """
        if str == None...]]></description><category></category></item><item><title><![CDATA[9.23 练手 腾讯50题 237 删除链表]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/101228527</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/101228527</guid><author>vancooler</author><pubDate>Mon, 23 Sep 2019 21:59:20 +0800</pubDate><description><![CDATA[Leetcode237.Delete Node in a Linked List

给一个节点，在链表中删除这个节点，不返回任何值。

代码如下：


class Solution(object):
    def deleteNode(self, node):
        """
        :type node: ListNode
        :rtype: void Do n...]]></description><category></category></item><item><title><![CDATA[9.22 练手 腾讯50题 160 寻找两链表交点]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/101174362</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/101174362</guid><author>vancooler</author><pubDate>Sun, 22 Sep 2019 22:09:01 +0800</pubDate><description><![CDATA[Leetcode160.Intersection of Two Linked Lists


Write a program to find the node at which the intersection of two singly linked lists begins.

For example, the following two linked lists:



begin to...]]></description><category></category></item><item><title><![CDATA[9.21 练手 腾讯50题 反转链表]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/101126570</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/101126570</guid><author>vancooler</author><pubDate>Sat, 21 Sep 2019 23:34:40 +0800</pubDate><description><![CDATA[Leetcode206.Reverse Linked List


Reverse a singly linked list.

Example:


Input: 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL
Output: 5-&gt;4-&gt;3-&gt;2-&gt;1-&gt;NULL


Follow up:

A linked list can be re...]]></description><category></category></item><item><title><![CDATA[9.19 练手 腾讯50题 142 链表找回环II]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/101031906</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/101031906</guid><author>vancooler</author><pubDate>Thu, 19 Sep 2019 18:42:42 +0800</pubDate><description><![CDATA[Leetcode142.Linked List Cycle II

步骤为：

判断是否有环 —&gt;没有 return None

            —&gt;有 一个一个走直到在环的入口相遇

代码如下：


class Solution(object):
    def detectCycle(self, head):
        """
    ...]]></description><category></category></item><item><title><![CDATA[9.17 练手 腾讯50题 61旋转链表]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/100907222</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/100907222</guid><author>vancooler</author><pubDate>Tue, 17 Sep 2019 00:29:41 +0800</pubDate><description><![CDATA[Leetcode61.Rotate List


Given a linkedlist, rotate the list to the right bykplaces, wherekis non-negative.

Example 1:


Input: 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL, k = 2
Output: 4-&gt;5-&gt;1-...]]></description><category></category></item><item><title><![CDATA[9.15 练手 腾讯50题 2两数相加]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/100851002</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/100851002</guid><author>vancooler</author><pubDate>Sun, 15 Sep 2019 12:11:51 +0800</pubDate><description><![CDATA[Leetcode2.Add Two Numbers


You are given twonon-emptylinked lists representing two non-negative integers. The digits are stored inreverse orderand each of their nodes contain a single digit. Ad...]]></description><category></category></item><item><title><![CDATA[9.13练手 腾讯50题 238 除了自己之外的乘积]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/100812520</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/100812520</guid><author>vancooler</author><pubDate>Fri, 13 Sep 2019 22:21:10 +0800</pubDate><description><![CDATA[Leetcode238.Product of Array Except Self


Given an arraynumsofnintegers wheren&gt; 1, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnu...]]></description><category></category></item><item><title><![CDATA[9.12练手 腾讯50题 217]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/100761108</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/100761108</guid><author>vancooler</author><pubDate>Thu, 12 Sep 2019 08:53:12 +0800</pubDate><description><![CDATA[Leetcode217.Contains Duplicate


Given an array of integers, find if the array contains any duplicates.

Your function should return true if any value appears at least twice in the array, and it sho...]]></description><category></category></item><item><title><![CDATA[9.11 练手 腾讯50题 121]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/100745626</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/100745626</guid><author>vancooler</author><pubDate>Thu, 12 Sep 2019 08:39:41 +0800</pubDate><description><![CDATA[Leetcode121.Best Time to Buy and Sell Stock


Say you have an array for which theithelement is the price of a given stock on dayi.

If you were only permitted to complete at most one transaction ...]]></description><category></category></item><item><title><![CDATA[9.10 练手 88]]></title><link>https://blog.youkuaiyun.com/vancooler/article/details/100716441</link><guid>https://blog.youkuaiyun.com/vancooler/article/details/100716441</guid><author>vancooler</author><pubDate>Tue, 10 Sep 2019 23:16:20 +0800</pubDate><description><![CDATA[Leetcode 88.Merge Sorted Array


Given two sorted integer arraysnums1andnums2, mergenums2intonums1as one sorted array.

Note:

The number of elements initialized innums1andnums2aremandn...]]></description><category></category></item></channel></rss>