<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_37606540的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_37606540</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_37606540]]></copyright><item><title><![CDATA[rust实现简单的tail命令]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/131598993</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/131598993</guid><author>m0_37606540</author><pubDate>Fri, 07 Jul 2023 16:03:20 +0800</pubDate><description><![CDATA[rust实现简单的tail命令。]]></description><category></category></item><item><title><![CDATA[JetBrains 系列临时进入试用期]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/121895283</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/121895283</guid><author>m0_37606540</author><pubDate>Sun, 12 Dec 2021 22:44:45 +0800</pubDate><description><![CDATA[JetBrains 系列临时进入试用期
删除文件  evaluation.key
一般在${user.home}/AppData/xxx 下

]]></description><category></category></item><item><title><![CDATA[django 分页查询大表，很慢]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/108437634</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/108437634</guid><author>m0_37606540</author><pubDate>Sun, 06 Sep 2020 22:38:39 +0800</pubDate><description><![CDATA[问题
mysql有一张20W+的表，包含创建时间字段job_create_time，有索引，主键job_id，同时包含另外十几个字段。根据创建时间orderby之后，对其进行分页查询，当查询最后几页的时候会超级慢。
性能低的django语句，耗时18s
类似下面的语句，从20W的数据中查询靠后的几条。此时查询非常慢。
    job_status = 'p'
    cur_page = int(200000/8)
    jobs = Job.objects.filter(job_status=job_s]]></description><category></category></item><item><title><![CDATA[python3 代码块加锁——避免多线程引起的bug]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/108136859</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/108136859</guid><author>m0_37606540</author><pubDate>Thu, 20 Aug 2020 23:01:05 +0800</pubDate><description><![CDATA[背景
客户端程序从rabbitmq消费，然后根据消息到远程服务器写密钥文件 authorized_keys等一系列操作, 如果同时到来两条消，可能导致异常。
代码加锁
lock = threading.Lock()
def write(thread_id):
	# 
    with lock:
        print(f'thread:{thread_id} line start')
        time.sleep(1)
        print(f'thread {thread_id}lin]]></description><category></category></item><item><title><![CDATA[ORA-00257: archiver error. Connect internal only, until freed 错误的处理方法]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/86134901</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/86134901</guid><author>m0_37606540</author><pubDate>Wed, 09 Jan 2019 10:25:53 +0800</pubDate><description><![CDATA[archive log 日志已满
ORA-00257: archiver error. Connect internal only, until freed 错误的处理方法


用sys用户登录
sqlplus sys/pass@tt as sysdba


看看archiv log所在位置
SQL&amp;amp;gt; show parameter log_archive_dest;
　　NAME      ...]]></description><category></category></item><item><title><![CDATA[最大堆  的 python 实现]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/83629477</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/83629477</guid><author>m0_37606540</author><pubDate>Fri, 02 Nov 2018 00:34:22 +0800</pubDate><description><![CDATA[数组存储数据 ，数组0元素位置设置哨兵，为sys.maxsize最大整数。
python3的整数除法为  //
&amp;gt;&amp;gt;&amp;gt; 5//2
2

import sys

class MaxHeap:

    def __init__(self, size):
        self._size = size
        self._max_heap = [sys.maxsize]
...]]></description><category></category></item><item><title><![CDATA[Ubuntu install gcc]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/82150428</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/82150428</guid><author>m0_37606540</author><pubDate>Tue, 28 Aug 2018 16:39:44 +0800</pubDate><description><![CDATA[Ubuntu安装gcc

sudo apt install build-essential]]></description><category></category></item><item><title><![CDATA[动态规划和贪婪算法   《剑指offer》 面试题14]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/80405398</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/80405398</guid><author>m0_37606540</author><pubDate>Tue, 22 May 2018 15:55:32 +0800</pubDate><description><![CDATA[动态规划



动态规划特点


求一个问题的最优解
整体问题的最优解依赖各自问题的最优解
小问题之间还有相互重叠的更小的子问题
为了避免小问题的重复求解，采用从上往下分析和从下往上求解的方法求解问题




贪婪算法

每一步都作出最贪婪的做法，需要用数学的方式证明是对的



剪绳子

题目一：给你一根长度为n的绳子，请把绳子剪成m段 (m和n都是整数，n&amp;gt;1并且m&amp;gt;1)每段绳子的...]]></description><category></category></item><item><title><![CDATA[lintcode 6 MergeTwoArray]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/80326069</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/80326069</guid><author>m0_37606540</author><pubDate>Tue, 15 May 2018 17:29:54 +0800</pubDate><description><![CDATA[lintcode 6 MergeTwoArray

描述

合并两个排序的整数数组A和B变成一个新的数组。

样例

给出                          A=[1,2,3,4]，B=[2,4,5,6]， 
返回                          [1,2,2,3,4,4,5,6]

挑战

你能否优化你的算法，如果其中一个数组很大而另一个数组很小？



解决
...]]></description><category></category></item><item><title><![CDATA[lintcode 8 RotateString]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/80325947</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/80325947</guid><author>m0_37606540</author><pubDate>Tue, 15 May 2018 17:25:39 +0800</pubDate><description><![CDATA[lintcode 13 RotateString

描述

给定一个字符串和一个偏移量，根据偏移量旋转字符串(从左向右旋转)

您在真实的面试中是否遇到过这个题？  



样例

对于字符串 “abcdefg”.



offset=0 =&amp;gt; &quot;abcdefg&quot;
offset=1 =&amp;gt; &quot;gabcdef&quot;
offset=2 =&amp;gt; &quot;fgabcde&quot;
offset=3 =&amp;gt;...]]></description><category></category></item><item><title><![CDATA[lintcode 9]]></title><link>https://blog.youkuaiyun.com/m0_37606540/article/details/80325415</link><guid>https://blog.youkuaiyun.com/m0_37606540/article/details/80325415</guid><author>m0_37606540</author><pubDate>Tue, 15 May 2018 17:01:44 +0800</pubDate><description><![CDATA[描述给你一个整数n. 从 1 到 n 按照下面的规则打印每个数：如果这个数被3整除，打印fizz.如果这个数被5整除，打印buzz.如果这个数能同时被3和5整除，打印fizz buzz.样例比如 n = 15, 返回一个字符串数组：[
  &quot;1&quot;, &quot;2&quot;, &quot;fizz&quot;,
  &quot;4&quot;, &quot;buzz&quot;, &quot;fizz&quot;,
  &quot;7&quot;, &quot;8&quot;, &qu]]></description><category></category></item></channel></rss>