<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sdhfaka的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sdhfaka</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sdhfaka]]></copyright><item><title><![CDATA[[Leetcode] 126 Word Ladder II 解题 (和127的对比)]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/125044354</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/125044354</guid><author>sdhfaka</author><pubDate>Mon, 30 May 2022 12:42:12 +0800</pubDate><description><![CDATA[Loading...https://leetcode.com/problems/word-ladder-ii/

这道题区别于127 Word Ladder 在于

1. 127求的是最短路径长度；本题求的是最短路径

2. 127 求的是一个值，本题求的是所有的最短路径

为了解决这个变化，关键点是

1. 对于上一层之前访问的节点我们不能再访问了

2. 对于下一层要访问的节点，我们要记录所有的路径。






class Solution:
    def findLadders(self, be.]]></description><category></category></item><item><title><![CDATA[[Leetcode] 127 Word Ladder 解题]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/125039598</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/125039598</guid><author>sdhfaka</author><pubDate>Mon, 30 May 2022 07:08:02 +0800</pubDate><description><![CDATA[class Solution:
    
    #################################################
    ######  solution 3: Bi-directional BFS     ######
    # search from both side and check if they meet  #
    #################################################
    from collectio.]]></description><category></category></item><item><title><![CDATA[Leetcode 359 Logger Rate limit]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/125013875</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/125013875</guid><author>sdhfaka</author><pubDate>Sat, 28 May 2022 07:02:16 +0800</pubDate><description><![CDATA[[Leetcode] 359 Logger Rate limit




class Logger:

    def __init__(self):
        # key=message(str), value=timestamp_last_sent(int)
        self.msg_sent = {}
        self.cap = 10
        

    def shouldPrintMessage(self, timestamp: int, message: str)]]></description><category></category></item><item><title><![CDATA[Leetcode 435. Non-overlapping Intervals]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/124905968</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/124905968</guid><author>sdhfaka</author><pubDate>Sun, 22 May 2022 01:16:09 +0800</pubDate><description><![CDATA[​​​​​​Loading...



DP solution


class Solution:
    def eraseOverlapIntervals(self, intervals: List[List[int]]) -&gt; int:
        if not intervals:
            return 0
        
        # initialize DP
        dp = [0] * len(intervals)
        dp[0] = 1]]></description><category></category></item><item><title><![CDATA[[刷题] 分治法]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/124441731</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/124441731</guid><author>sdhfaka</author><pubDate>Wed, 27 Apr 2022 06:55:14 +0800</pubDate><description><![CDATA[​​​​​​1.474 · Lowest Common Ancestor II

大

2.
]]></description><category></category></item><item><title><![CDATA[python (python3) 基础知识点 (更新中）]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/124418219</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/124418219</guid><author>sdhfaka</author><pubDate>Tue, 26 Apr 2022 00:32:47 +0800</pubDate><description><![CDATA[总结一些常用的关于 python dict 的知识点

初始化 / 新建 字典


new_dict = {}  # new dict with empty items
new_dict = dict()  # new dict with empty items

查找

遍历

类型 / typing


]]></description><category></category></item><item><title><![CDATA[Leetcode 59 Spiral Matrix II]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/123932231</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/123932231</guid><author>sdhfaka</author><pubDate>Sun, 03 Apr 2022 07:19:31 +0800</pubDate><description><![CDATA[class Solution {
    public int[][] generateMatrix(int n) {
        int[][] M = new int[n][n];
        return generate(M, n);
    }
    
    private int[][] generate(int[][] M, int k) {
        int loop = k / 2;
        int start_x = 0;
        int start_.]]></description><category></category></item><item><title><![CDATA[[Leetcode]吹响征战Leetcode的号角]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/39008791</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/39008791</guid><author>sdhfaka</author><pubDate>Tue, 02 Sep 2014 17:09:34 +0800</pubDate><description><![CDATA[写这篇，没别的意思，就是告诉自己，要开始刷Leetcode了。想起当初第一遍刷GRE单词的时候，太痛苦了，太]]></description><category></category></item><item><title><![CDATA[[安装]Vim插件YouCompleteMe在mac下的安装]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/35636731</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/35636731</guid><author>sdhfaka</author><pubDate>Sat, 28 Jun 2014 23:43:12 +0800</pubDate><description><![CDATA[a]]></description><category></category></item><item><title><![CDATA[Ubuntu下安装scikit-learn(sklearn)]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/22040527</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/22040527</guid><author>sdhfaka</author><pubDate>Tue, 25 Mar 2014 10:21:59 +0800</pubDate><description><![CDATA[按说，这个安装应该也不是很困难，但是官方网站的说明在我看来写的实在是有待改进，所以写文一篇，方便以后安装。


背景：
Ubuntu 13.04
python 2 .7. 4（系统预装）


步骤：
官方原文见此链接


1. 安装支持部分：
在terminal里面直接输入以下命令，这个命令会安装sklearn所需要的依赖，主要包括 scipy, numpy一些主流依赖。]]></description><category></category></item><item><title><![CDATA[Vim插件YouCompleteMe翻译之 README.md(Part I)]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/19025323</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/19025323</guid><author>sdhfaka</author><pubDate>Mon, 10 Feb 2014 04:37:15 +0800</pubDate><description><![CDATA[截止目前，已经成功实现了用YCM来完成对 Python 和 C++ 的自动补全，心情大好，于是跑回来继续完成翻译工作，就当攒人品啦。
——————————————分割线————————————————
原文请点我
—— Translation starts here ——
YouCompleteMe: a code-completion engine for Vim


YouCom]]></description><category></category></item><item><title><![CDATA[Vim插件YouCompleteMe翻译之UserGuide I.]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/18898465</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/18898465</guid><author>sdhfaka</author><pubDate>Sun, 02 Feb 2014 11:20:11 +0800</pubDate><description><![CDATA[原文如下：
自己在安装使用这个插件的时候遇到了不少曲折，现在这里对用户指导进行翻译，一来让自己能够耐下心来通读一遍，二来方便其他朋友使用。


用户指导 (User Guide)
一般用法 (General Usage)：
   ·如果觉得补全功能太广泛的话，只需要继续输入代码即可；YCM会基于你的输入持续修正补全功能。
   ·过滤功能是“smart-case(智能大小写)”敏感的]]></description><category></category></item><item><title><![CDATA[[安装]ubuntu 如何修改 .vimrc 文件]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/18892807</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/18892807</guid><author>sdhfaka</author><pubDate>Sat, 01 Feb 2014 05:40:23 +0800</pubDate><description><![CDATA[很多东西确实是难了不会，会了不难。今天想在ubuntu里配置一下vim，结果折腾了老半天。原因就是一直找不到别人说的那个 .vimrc文件，后来才知道，原来这个文件默认是不存在的，需要先自己创建一下，现介绍如下：


1. 拷贝方法：将系统配置vimrc文件拷贝一份：
在terminal里面输入
cp /usr/share/vim/vimrc $HOME/.vimrc

说明：]]></description><category></category></item><item><title><![CDATA[[安装]Windows 系统下 GVIM安装]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/18597889</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/18597889</guid><author>sdhfaka</author><pubDate>Tue, 21 Jan 2014 10:29:55 +0800</pubDate><description><![CDATA[Windows 系统下： 


1. 安装GVIM和GitHub for Windows：

安装和设置Gvim, 请参考这篇文章中的Step1。如果是传统版本的GitHub客户端，请参考这篇文章中的Step2：
http://blog.youkuaiyun.com/auwzb/article/details/9346517 
如果下载的是PortableGit, 请参考这篇文章：
http:]]></description><category></category></item><item><title><![CDATA[小白级别准程序员在windows下安装GitHub]]></title><link>https://blog.youkuaiyun.com/sdhfaka/article/details/18593725</link><guid>https://blog.youkuaiyun.com/sdhfaka/article/details/18593725</guid><author>sdhfaka</author><pubDate>Tue, 21 Jan 2014 09:59:56 +0800</pubDate><description><![CDATA[自己目前是专业级小白，所以写这篇文章，希望能够帮到有需要的朋友。


最近(截至2014.1.20）GitHub for Windows升级了，出了一个移动版GitHub客户端给windows用（Github 1.8.4)，直接导致了环境变量修改的相应改变。


Step 1: 谷歌搜索 GitHub for Windows, 一般出来的第一个链接就是，点进去应该就是下图的样子，然后点]]></description><category></category></item></channel></rss>