<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Bittersweet_t的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Bittersweet_t</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Bittersweet_t]]></copyright><item><title><![CDATA[Leetcode日练笔记41 [二叉树recursion专题] #250 Count Univalue Subtrees /Medium {Python}]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/132507125</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/132507125</guid><author>Bittersweet_t</author><pubDate>Wed, 20 Sep 2023 00:57:57 +0800</pubDate><description><![CDATA[Leetcode日练笔记41 [二叉树recursion专题] #250 Count Univalue Subtrees /medium {Python}]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记40 [二叉树recursion专题] #112 Path Sum]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/132487321</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/132487321</guid><author>Bittersweet_t</author><pubDate>Fri, 25 Aug 2023 07:53:15 +0800</pubDate><description><![CDATA[Leetcode日练笔记40 【二叉树专题】Recursive思路训练 #112 Path Sum Easy {Python} ]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记39 [二叉树recursion专题] #104 #101 Maximum Depth of Binary Tree & Symmetric Tree {Python}]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125746407</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125746407</guid><author>Bittersweet_t</author><pubDate>Tue, 12 Jul 2022 19:12:52 +0800</pubDate><description><![CDATA[Leetcode日练笔记39 【二叉树专题】Recursive思路训练 #104 & #101 Maximum Depth of Binary Tree & Symmetric Tree {Python} ]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记38 [二叉树专题] #102 Binary Tree Level Order Traversal]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125590940</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125590940</guid><author>Bittersweet_t</author><pubDate>Tue, 12 Jul 2022 12:28:09 +0800</pubDate><description><![CDATA[Leetcode日练笔记 【二叉树专题】 BFS #102 Binary Tree Level Order Traversal (Python) Iterative + Recursive思路]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记37 [二叉树专题] #145 Binary Tree Postorder Traversal]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125447059</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125447059</guid><author>Bittersweet_t</author><pubDate>Sat, 02 Jul 2022 16:50:24 +0800</pubDate><description><![CDATA[postorder traversal python]]></description><category></category></item><item><title><![CDATA[Leetcode36 [二叉树专题] 基本概念 & #144 #94 Binary Tree Preorder Traversal & Binary Tree Inorder Traversal]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125370047</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125370047</guid><author>Bittersweet_t</author><pubDate>Tue, 21 Jun 2022 12:06:45 +0800</pubDate><description><![CDATA[Leetcode 【Binary Tree专题】#144 Preorder Traversal & #94 Binary Tree Inorder Traversal (Python解法)]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记35 [Linked List专题] #138 #61 Copy List with Random Pointer & Rotate List]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125353279</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125353279</guid><author>Bittersweet_t</author><pubDate>Sun, 19 Jun 2022 13:58:52 +0800</pubDate><description><![CDATA[Leetcode Linked List专题 #138 Copy List with Random Pointer & #61 Rotate List【Python解法】]]></description><category></category></item><item><title><![CDATA[Leetcode34[Linked List专题] #430 #708 Flatten a Multilevel Doubly Linked List & Insert into a Cyclic S]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125314856</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125314856</guid><author>Bittersweet_t</author><pubDate>Sat, 18 Jun 2022 23:39:48 +0800</pubDate><description><![CDATA[Leetcode [Linked List专题] #430 Flatten a Multilevel Doubly Linked List Python解法]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记33 [linked list专题] #21 #2 Merge Two Sorted Lists & Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125274892</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125274892</guid><author>Bittersweet_t</author><pubDate>Thu, 16 Jun 2022 13:55:00 +0800</pubDate><description><![CDATA[Leetcode Linked List专题 #21 Merged Two Linked List & #2 Add Two Numbers Python解法]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记32 [Linked List专题] #328 #234 Odd Even Linked List & Palindrome Linked List]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125247172</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125247172</guid><author>Bittersweet_t</author><pubDate>Mon, 13 Jun 2022 12:07:22 +0800</pubDate><description><![CDATA[Leetcode 链表专题 #328 奇偶点链表 #234 回文结构的判断 Python解法]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记31 #19 #206 # 203 Rmv Nth Node From End & Reverse Linked List & Rmv Linked List Elements]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125218821</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125218821</guid><author>Bittersweet_t</author><pubDate>Sat, 11 Jun 2022 15:17:10 +0800</pubDate><description><![CDATA[Leetcode 链表专题 #19 #206 #203 Remove Nth Node From End of List & Reverse Linked List & remove element from the linked list]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记30 [Linked List专题] #142 #160 Linked List Cycle II & Intersection of Two Linked Lists]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125199472</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125199472</guid><author>Bittersweet_t</author><pubDate>Fri, 10 Jun 2022 11:37:57 +0800</pubDate><description><![CDATA[Leetcode 链表专题 #142 Linked List Cycle II #160 Intersections of two Linked List （Python解法）]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记29 [Linked List专题] #707 #141 Design Linked List & Linked List Cycle]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125188156</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125188156</guid><author>Bittersweet_t</author><pubDate>Thu, 09 Jun 2022 10:58:38 +0800</pubDate><description><![CDATA[Leetcode 链表专题 #707 #141 Python解法]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记28 #151 #557 Reverse Words in a String & Reverse Words in a String III]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125163659</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125163659</guid><author>Bittersweet_t</author><pubDate>Tue, 07 Jun 2022 16:10:37 +0800</pubDate><description><![CDATA[Leetcode 151和557 reverse words in a string Python解法]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记27 #189 #119 Rotate Array & Pascal‘s Triangle II]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125061234</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125061234</guid><author>Bittersweet_t</author><pubDate>Tue, 31 May 2022 15:59:58 +0800</pubDate><description><![CDATA[Given an array, rotate the array to the right byksteps, wherekis non-negative.


解题思路：

for循环range(k), 然后用pop()去掉最后一位并通过insert()加入数列最前面。


class Solution:
    def rotate(self, nums: List[int], k: int) -&gt; None:
        """
        Do not return anyt...]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记26 #561 #209 Array Partition I & Minimum Size Subarray Sum]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125039973</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125039973</guid><author>Bittersweet_t</author><pubDate>Mon, 30 May 2022 11:25:04 +0800</pubDate><description><![CDATA[#561 Array Partition I


Given an integer arraynumsof2nintegers, group these integers intonpairs(a1, b1), (a2, b2), ..., (an, bn)such that the sum ofmin(ai, bi)for alliismaximized. Returnthe maximized sum.


解题思路：

能获得pair里min之和的最大值策略是从小到大排列，...]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记25 #14 #344 Longest Common Prefix & Reverse String]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125029071</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125029071</guid><author>Bittersweet_t</author><pubDate>Sun, 29 May 2022 14:11:47 +0800</pubDate><description><![CDATA[#14 Longest Common Prefix


Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string"".


解题思路：

1.for循环range(最短的元素)作为idx

2.以第一个元素[idx]为比较参照点，对比strs里每一个元素[idx]

3.全部相等的话，.]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记24 #67 #28 Add Binary & Implement strStr()]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125017395</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125017395</guid><author>Bittersweet_t</author><pubDate>Sat, 28 May 2022 18:30:07 +0800</pubDate><description><![CDATA[#67 Add Binary


Given two binary stringsaandb, returntheir sum as a binary string.


解题思路：

1. 考虑到 string A B 的长度可能不一样所以先补齐零。

2. 然后将string A和B 同一个index的数字求和之后赋予给新的string，new

3. 用for循环去从后往前看new每一个数位是不是大于2。逢二进一。

4.将new转变为string输出。


class Solution:
 ...]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记23 #54 #118 Spinal Matrix & Pascal‘s Triangle]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125002140</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/125002140</guid><author>Bittersweet_t</author><pubDate>Fri, 27 May 2022 16:45:00 +0800</pubDate><description><![CDATA[#54 Spiral Matrix


Given anm x nmatrix, returnall elements of thematrixin spiral order.


解题思路：

for循环m*n次，然后先column+=1，当column遇到最大值时，再row+=1。等到row也到了最大值，就掉头（体现为d *= -1），column-=1，当column遇到最小值时，再row-=1.每次掉头，都要改变row和column的极限值，因为读过数的idx就不能要了。要么是改row的...]]></description><category></category></item><item><title><![CDATA[Leetcode日练笔记22 #66 #498 Plus One & Diagonal Traverse]]></title><link>https://blog.youkuaiyun.com/Bittersweet_t/article/details/124982108</link><guid>https://blog.youkuaiyun.com/Bittersweet_t/article/details/124982108</guid><author>Bittersweet_t</author><pubDate>Thu, 26 May 2022 22:00:41 +0800</pubDate><description><![CDATA[#66 Plus One


You are given alarge integerrepresented as an integer arraydigits, where eachdigits[i]is theithdigit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not ...]]></description><category></category></item></channel></rss>