<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LY]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_41007998</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_41007998]]></copyright><item><title><![CDATA[Typora激活办法]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/148726669</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/148726669</guid><author>qq_41007998</author><pubDate>Wed, 18 Jun 2025 00:20:07 +0800</pubDate><description><![CDATA[摘要： 本文提供Typora（Markdown编辑器）的详细安装教程。首先从指定地址下载安装包（含补丁），然后运行exe安装程序，默认勾选创建桌面图标并完成安装。安装结束后暂不启动软件，后续需参考破解教程完成激活。全文步骤清晰，适合快速上手安装。]]></description><category></category></item><item><title><![CDATA[win电脑按照wsl配置python环境]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/135582338</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/135582338</guid><author>qq_41007998</author><pubDate>Sun, 14 Jan 2024 15:48:30 +0800</pubDate><description><![CDATA[配置wsl的环境的时候，出现包加载不出来，解决办法是。看b站视频麦兜搞IT的视频，搜WSL2。]]></description><category></category></item><item><title><![CDATA[pip系列知识大全]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/122434603</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/122434603</guid><author>qq_41007998</author><pubDate>Tue, 11 Jan 2022 15:52:24 +0800</pubDate><description><![CDATA[pip install 和conda install有什么区别吗？
https://www.zhihu.com/question/395145313
pip设置虚拟环境
https://zhuanlan.zhihu.com/p/60647332

]]></description><category></category></item><item><title><![CDATA[NLP学习资料库]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/122379209</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/122379209</guid><author>qq_41007998</author><pubDate>Sat, 08 Jan 2022 13:28:58 +0800</pubDate><description><![CDATA[学习资料]]></description><category></category></item><item><title><![CDATA[Python collections模块使用方法详解]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120953231</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120953231</guid><author>qq_41007998</author><pubDate>Mon, 25 Oct 2021 15:50:20 +0800</pubDate><description><![CDATA[有四个函数
1.collections
（1）作用：tuple类型，是一个可命名的tuple
（2）格式：collections(列表名称，列表）
（3）​返回值：一个含有列表的类
import collections
# help(collections.namedtuple)
Point = collections.namedtuple("Point",['x','y'])
p = Point(15,45)
print(p.x+p.y)
print(p[0]+p[1])
#支持索引等
#应用举例
Cir]]></description><category></category></item><item><title><![CDATA[windows下 tensorflow-gpu版本缺dll]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120918532</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120918532</guid><author>qq_41007998</author><pubDate>Sat, 23 Oct 2021 11:13:37 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/qingfengxd1/article/details/107856678

]]></description><category></category></item><item><title><![CDATA[2021win10+CUDA+cuDNN+tensorflow2.0-10-22]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120904196</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120904196</guid><author>qq_41007998</author><pubDate>Fri, 22 Oct 2021 13:37:58 +0800</pubDate><description><![CDATA[TensorFlow2.0版本不需要再安装keras

]]></description><category></category></item><item><title><![CDATA[列表转树的相互转换以及层序遍历，前序遍历，中序遍历，后序遍历]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120757800</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120757800</guid><author>qq_41007998</author><pubDate>Thu, 14 Oct 2021 09:47:17 +0800</pubDate><description><![CDATA[添加链接描述

]]></description><category></category></item><item><title><![CDATA[链表头结点的问题]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120551469</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120551469</guid><author>qq_41007998</author><pubDate>Wed, 29 Sep 2021 16:36:45 +0800</pubDate><description><![CDATA[slow = head
        fast = head
        for i in range(n):
            fast = fast.next
            print(fast.val)
        while fast:
            fast = fast.next
            
            slow = slow.next
            # print(fast.val)
           ...]]></description><category></category></item><item><title><![CDATA[数组-旋转图像]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120342497</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120342497</guid><author>qq_41007998</author><pubDate>Fri, 17 Sep 2021 09:38:36 +0800</pubDate><description><![CDATA[对于矩阵中第 i 行的第 j 个元素，在旋转后，它出现在倒数第 i列的第 j 个位置。

class Solution:
    def rotate(self, matrix: List[List[int]]) -&gt; None:
        n = len(matrix)
        # Python 这里不能 matrix_new = matrix 或 matrix_new = matrix[:] 因为是引用拷贝
        matrix_new = [[0] * n for _ i.]]></description><category></category></item><item><title><![CDATA[数组-三数之和]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120307888</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120307888</guid><author>qq_41007998</author><pubDate>Wed, 15 Sep 2021 14:28:28 +0800</pubDate><description><![CDATA[思路
题目中要求找到所有「不重复」且和为 000 的三元组，这个「不重复」的要求使得我们无法简单地使用三重循环枚举所有的三元组。这是因为在最坏的情况下，数组中的元素全部为 000，即
[0, 0, 0, 0, 0, …, 0, 0, 0]
任意一个三元组的和都为 000。如果我们直接使用三重循环枚举三元组，会得到 O(N3)O(N^3)O(N3) 个满足题目要求的三元组（其中 NNN 是数组的长度）时间复杂度至少为 O(N3)O(N^3)O(N3)。在这之后，我们还需要使用哈希表进行去重操作，得到不包含重复]]></description><category></category></item><item><title><![CDATA[哈希表-有效的括号]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120306586</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120306586</guid><author>qq_41007998</author><pubDate>Wed, 15 Sep 2021 13:25:13 +0800</pubDate><description><![CDATA[算法流程

如果 c 是左括号，则入栈 pushpushpush；
否则通过哈希表判断括号对应关系，若 stack 栈顶出栈括号 stack.pop() 与当前遍历括号 c 不对应，则提前返回 falsefalsefalse。

class Solution:
    def isValid(self, s: str) -&gt; bool:
        dic = {'{': '}',  '[': ']', '(': ')', '?': '?'}
        stack = ['?']
     ]]></description><category></category></item><item><title><![CDATA[哈希表 - 字母异位词分组]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120203736</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120203736</guid><author>qq_41007998</author><pubDate>Thu, 09 Sep 2021 16:19:58 +0800</pubDate><description><![CDATA[输入: strs = ["eat", "tea", "tan", "ate", "nat", "bat"]
输出: [["bat"],["nat","tan"],["ate","eat","tea"]]

思路：建一个字典，然后把所有的str排序，利用键值对来添加列表，最后打印出所有键的值（列表）
strs = ["eat", "tea", "tan", "ate", "nat", "bat"]
import collections

mp = collections.defaultdict(list)

]]></description><category></category></item><item><title><![CDATA[哈希表 - 字符串中的第一个唯一字符]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120201184</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120201184</guid><author>qq_41007998</author><pubDate>Thu, 09 Sep 2021 14:50:48 +0800</pubDate><description><![CDATA[思路：先把唯一的数都放在字典里，然后根据字典的键值对，也就是索引的值来判断一对一的比长度大小
s = "leetcode"
返回 0

s = "loveleetcode"
返回 2

hash = dict()
n = len(nums)
for i,ch in enumates(nums):
    if ch in hash:
    hash[ch] = -1
   else:
      hash[ch] = i 
 first  = n 
 for k in hash.vlaues():
   ]]></description><category></category></item><item><title><![CDATA[哈希表-两个列表的最小索引总和]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120199409</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120199409</guid><author>qq_41007998</author><pubDate>Thu, 09 Sep 2021 13:29:57 +0800</pubDate><description><![CDATA[输入:
["Shogun", "Tapioca Express", "Burger King", "KFC"]
["KFC", "Shogun", "Burger King"]
输出: ["Shogun"]
解释: 他们共同喜爱且具有最小索引和的餐厅是“Shogun”，它有最小的索引和1(0+1)。

class Solution:
    def findRestaurant(self, list1: List[str], list2: List[str]) -&gt; List[str]:
      ]]></description><category></category></item><item><title><![CDATA[哈希表-同构字符串]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120196812</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120196812</guid><author>qq_41007998</author><pubDate>Thu, 09 Sep 2021 11:15:53 +0800</pubDate><description><![CDATA[给定两个字符串 s 和 t，判断它们是否是同构的。
如果 s 中的字符可以按某种映射关系替换得到 t ，那么这两个字符串是同构的。
每个出现的字符都应当映射到另一个字符，同时不改变字符的顺序。不同字符不能映射到同一个字符上，相同字符只能映射到同一个字符上，字符可以映射到自己本身。
输入：s = "egg", t = "add"
输出：true

思路：利用index函数，遍历长度，判断是否一致

...]]></description><category></category></item><item><title><![CDATA[哈希表-两数之和，最优解]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120196386</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120196386</guid><author>qq_41007998</author><pubDate>Thu, 09 Sep 2021 10:46:37 +0800</pubDate><description><![CDATA[输入：nums = [2,7,11,15], target = 9
输出：[0,1]
解释：因为 nums[0] + nums[1] == 9 ，返回 [0, 1] 。

思路：注意到方法一的时间复杂度较高的原因是寻找 target - x 的时间复杂度过高。因此，我们需要一种更优秀的方法，能够快速寻找数组中是否存在目标元素。如果存在，我们需要找出它的索引。
使用哈希表，可以将寻找 target - x 的时间复杂度降低到从 O(N)O(N)O(N) 降低到 O(1)O(1)O(1)。
这样我们创建一个哈希]]></description><category></category></item><item><title><![CDATA[哈希表-两个数组的交集]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120073689</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120073689</guid><author>qq_41007998</author><pubDate>Thu, 09 Sep 2021 10:12:31 +0800</pubDate><description><![CDATA[思路：把两个列表转成集合，然后利用集合求交集

]]></description><category></category></item><item><title><![CDATA[DJANGO关于存储多对多关系，数据库报错的问题]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/120062060</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/120062060</guid><author>qq_41007998</author><pubDate>Thu, 02 Sep 2021 15:17:34 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/yinhaiping/p/13681522.html

]]></description><category></category></item><item><title><![CDATA[Django清空数据库]]></title><link>https://blog.youkuaiyun.com/qq_41007998/article/details/119749632</link><guid>https://blog.youkuaiyun.com/qq_41007998/article/details/119749632</guid><author>qq_41007998</author><pubDate>Tue, 17 Aug 2021 09:57:14 +0800</pubDate><description><![CDATA[https://m.runoob.com/sqlite/sqlite-drop-table.html
网址如上

]]></description><category></category></item></channel></rss>