<![CDATA[tech_zwl的博客]]>

<![CDATA[tech_zwl的博客]]>https://blog.youkuaiyun.com/tech_zwlzh-cnhttps://blog.youkuaiyun.com/<![CDATA[LeetCode 294. Flip Game II (你给翻译翻译，什么叫做guarantee?)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/116641290https://blog.youkuaiyun.com/tech_zwl/article/details/116641290tech_zwlTue, 11 May 2021 11:38:28 +0800<![CDATA[LeetCode 326. Power of Three (简单题的四种求解方式)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/116261785https://blog.youkuaiyun.com/tech_zwl/article/details/116261785tech_zwlMon, 03 May 2021 23:37:03 +0800<![CDATA[工作笔记：如何用Django连接Kerberized甲骨文(Oracle)数据库]]>https://blog.youkuaiyun.com/tech_zwl/article/details/116008893https://blog.youkuaiyun.com/tech_zwl/article/details/116008893tech_zwlThu, 22 Apr 2021 13:06:43 +0800<![CDATA[LeetCode 1835. Find XOR Sum of All Pairs Bitwise AND (鲜为人知的XOR和AND公式)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115826638https://blog.youkuaiyun.com/tech_zwl/article/details/115826638tech_zwlMon, 19 Apr 2021 02:02:31 +0800<![CDATA[LeetCode 1829. Maximum XOR for Each Query (熟悉xor操作就是简单题，不熟悉就懵了)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115808659https://blog.youkuaiyun.com/tech_zwl/article/details/115808659tech_zwlSun, 18 Apr 2021 04:14:06 +0800<![CDATA[LeetCode 239. Sliding Window Maximum (经典双端队列dequeue题目，附加动态规划解法)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115780883https://blog.youkuaiyun.com/tech_zwl/article/details/115780883tech_zwlSat, 17 Apr 2021 12:16:45 +0800<![CDATA[流编辑器sed的系统性讲解 - 第三节（共七节）- 地址规范(Address Specification)，模式空间(Pattern Space)，保持空间(Hold Space)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115715605https://blog.youkuaiyun.com/tech_zwl/article/details/115715605tech_zwlThu, 15 Apr 2021 14:24:37 +0800<![CDATA[LeetCode 1755. Closest Subsequence Sum (时间复杂度为2^N时的数学优化）]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115562812https://blog.youkuaiyun.com/tech_zwl/article/details/115562812tech_zwlSat, 10 Apr 2021 16:09:02 +0800<![CDATA[LeetCode 17. Letter Combinations of a Phone Number (如何用迭代Iteration替代回溯法Backtracking)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115536646https://blog.youkuaiyun.com/tech_zwl/article/details/115536646tech_zwlFri, 09 Apr 2021 10:15:12 +0800<![CDATA[Leetcode 23. Merge k Sorted Lists (链表难度天花板之一)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115481554https://blog.youkuaiyun.com/tech_zwl/article/details/115481554tech_zwlThu, 08 Apr 2021 03:45:12 +0800<![CDATA[Leetcode 25. Reverse Nodes in k-Group (链表难度天花板之二)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115479274https://blog.youkuaiyun.com/tech_zwl/article/details/115479274tech_zwlWed, 07 Apr 2021 11:06:14 +0800<![CDATA[LeetCode 775. Global and Local Inversions (题目问的不一定就是解决问题的必经之路，换个思路也许有更简单的解法)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115450747https://blog.youkuaiyun.com/tech_zwl/article/details/115450747tech_zwlTue, 06 Apr 2021 00:12:52 +0800<![CDATA[流编辑器sed的系统性讲解 - 第二节（共七节）- sed命令的结构，底层原理和调试]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115438792https://blog.youkuaiyun.com/tech_zwl/article/details/115438792tech_zwlMon, 05 Apr 2021 13:05:43 +0800<![CDATA[Leetcode 1814. Count Nice Pairs in an Array (数学方法巧解，警惕时间复杂度思维陷阱)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115426052https://blog.youkuaiyun.com/tech_zwl/article/details/115426052tech_zwlSun, 04 Apr 2021 13:46:30 +0800<![CDATA[流编辑器sed的系统性讲解 - 第一节（共七节）- sed简介，命名，历史和作用]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115412714https://blog.youkuaiyun.com/tech_zwl/article/details/115412714tech_zwlSat, 03 Apr 2021 11:17:56 +0800<![CDATA[Leetcode 234. Palinedrome Linked List (递归思想浅析)]]>https://blog.youkuaiyun.com/tech_zwl/article/details/115395636https://blog.youkuaiyun.com/tech_zwl/article/details/115395636tech_zwlFri, 02 Apr 2021 13:54:47 +0800