<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[无远弗届]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/SherryTuan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; SherryTuan]]></copyright><item><title><![CDATA[Leetcode606. Construct String from Binary Tree (C++)]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/106056771</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/106056771</guid><author>SherryTuan</author><pubDate>Mon, 11 May 2020 16:22:26 +0800</pubDate><description><![CDATA[Leetcode606. Construct String from Binary Tree
Leetcode606. Construct String from Binary Tree
递归方法可以一行完成，迭代方法比较麻烦。复杂度不佳，尚待提高。
代码如下：
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right]]></description><category></category></item><item><title><![CDATA[Leetcode590. N-ary Tree Postorder Traversal (C++)]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/106037205</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/106037205</guid><author>SherryTuan</author><pubDate>Sun, 10 May 2020 15:52:29 +0800</pubDate><description><![CDATA[Leetcode590. N-ary Tree Postorder Traversal
Leetcode590. N-ary Tree Postorder Traversal
和589类似，注意孩子节点的入栈顺序即可
代码如下：
/*
// Definition for a Node.
class Node {
public:
    int val;
    vector&lt;Node*&gt; children;

    Node() {}

    Node(int _val) {
       ]]></description><category></category></item><item><title><![CDATA[Leetcode589. N-ary Tree Preorder Traversal (C++)]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/106036301</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/106036301</guid><author>SherryTuan</author><pubDate>Sun, 10 May 2020 14:59:55 +0800</pubDate><description><![CDATA[Leetcode589. N-ary Tree Preorder Traversal
Leetcode589. N-ary Tree Preorder Traversal
递归与非递归（DFS）：
/*
// Definition for a Node.
class Node {
public:
    int val;
    vector&lt;Node*&gt; children;

    Node() {}

    Node(int _val) {
        val = _val;
   ]]></description><category></category></item><item><title><![CDATA[Leetcode617. Merge Two Binary Trees (C++)]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/106035719</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/106035719</guid><author>SherryTuan</author><pubDate>Sun, 10 May 2020 14:18:51 +0800</pubDate><description><![CDATA[Leetcode617. Merge Two Binary Trees
简单题，迭代比递归复杂一点点
代码如下：
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeN]]></description><category></category></item><item><title><![CDATA[Leetcode面试题 04.02. 最小高度树 (C++)]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/106033357</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/106033357</guid><author>SherryTuan</author><pubDate>Sun, 10 May 2020 11:06:28 +0800</pubDate><description><![CDATA[Leetcode面试题 04.02. 最小高度树
面试题 04.02. 最小高度树
简单递归构造树，解答如下：
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
clas]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-9 Lecture-2]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/80302040</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/80302040</guid><author>SherryTuan</author><pubDate>Sun, 13 May 2018 20:41:58 +0800</pubDate><description><![CDATA[Question在 Leetcode 下做一道题。Answer57. Insert Interval'''
LeetCode
Topic: Array

57. Insert Interval

Description:
        Given a set of non-overlapping intervals, insert a new interval into the 
       ...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-9 Lecture-1]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/80301999</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/80301999</guid><author>SherryTuan</author><pubDate>Sun, 13 May 2018 19:44:46 +0800</pubDate><description><![CDATA[Question在 Leetcode 上做一道题Answer'''
LeetCode
Topic: Array

42. Trapping Rain Water

Description:
        In a given array nums of positive integers, find three non-overlapping 
        subarrays with ma...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-8 Lecture-2]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/80193388</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/80193388</guid><author>SherryTuan</author><pubDate>Fri, 04 May 2018 12:34:12 +0800</pubDate><description><![CDATA[Question在 Leetcode 的 Topic: Array 下做一道题Answer407. Trapping Rain Water II'''
LeetCode
Topic: Array

407. Trapping Rain Water II

Description:
        Given an m x n matrix of positive integers represen...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-8 Lecture-1]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/80113731</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/80113731</guid><author>SherryTuan</author><pubDate>Fri, 27 Apr 2018 21:43:54 +0800</pubDate><description><![CDATA[Question在 Leetcode 的 Topic: Array 下做一道题Answer42. Trapping Rain Water'''
LeetCode
Topic: Array

42. Trapping Rain Water: https://leetcode.com/problems/trapping-rain-water

Description:
        Given n ...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-6 Lecture-1]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79955801</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79955801</guid><author>SherryTuan</author><pubDate>Mon, 16 Apr 2018 17:53:41 +0800</pubDate><description><![CDATA[Question教材中课后的练习，11-1到11-3，选一些写到你的博客上Answer'''
SYSU - [专选]高级编程技术 - Week6, Lecture1 HW       
by Duan       
2018.04.16
'''


'''
11-1 城市和国家：
'''
import unittest
from city_functions import get_formatte...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-5 Lecture-2]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79859737</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79859737</guid><author>SherryTuan</author><pubDate>Mon, 09 Apr 2018 00:49:59 +0800</pubDate><description><![CDATA[Question教材中课后的练习，10-1到10-13，选一些写到你的博客上Answer'''
SYSU - [专选]高级编程技术 - Week5, Lecture2 HW      
by Duan      
2018.04.08 
'''


'''
10-1 Python 学习笔记：
'''
filename = 'learning_python.txt'
with open(filena...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-5 Lecture-1]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79784246</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79784246</guid><author>SherryTuan</author><pubDate>Mon, 02 Apr 2018 08:59:40 +0800</pubDate><description><![CDATA[Question教材中课后的练习，9-1到9-15，选一些写到你的博客上Answer'''
SYSU - [专选]高级编程技术 - Week5, Lecture1 HW     
by Duan     
2018.04.02    
'''      


'''
9-1 餐馆：
'''
class Restaurant():
    def __init__(self, restaurant_...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-4 Lecture-2]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79732891</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79732891</guid><author>SherryTuan</author><pubDate>Wed, 28 Mar 2018 19:53:59 +0800</pubDate><description><![CDATA[Question教材中课后的练习，8-1到8-17，选一些写到你的博客上Answer''' 
SYSU - [专选]高级编程技术 - Week4, Lecture2 HW    
by Duan    
2018.03.28   
'''    

'''
8-1 消息
'''
def display_message():
    &quot;&quot;&quot;打印一个句子，指出本章的学习内容&quot;&quot;&quot;
    print(...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-4 Lecture-1]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79703374</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79703374</guid><author>SherryTuan</author><pubDate>Mon, 26 Mar 2018 20:34:27 +0800</pubDate><description><![CDATA[Question教材中课后的练习，7-1到7-10，选一些写到你的博客上Answer''' 
SYSU - [专选]高级编程技术 - Week4, Lecture1 HW    
by Duan    
2018.03.26   
'''    


'''
7-1 汽车租赁
'''
car = input('What kind of car would you like? ')
print('L...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-3 Lecture-2]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79652574</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79652574</guid><author>SherryTuan</author><pubDate>Thu, 22 Mar 2018 13:11:35 +0800</pubDate><description><![CDATA[Question教材中课后的练习，6-1到6-12，选一些写到你的博客上Answer''''' 
SYSU - [专选]高级编程技术 - Week3, Lecture2 HW    
by Duan    
2018.03.22
'''    


'''
6-1 人
'''
info = {'first_name': 'Ying', 'last_name': 'Jiang', 'age': 37...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-3 Lecture-1]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79614055</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79614055</guid><author>SherryTuan</author><pubDate>Mon, 19 Mar 2018 18:02:12 +0800</pubDate><description><![CDATA[Question教材中课后的练习，5-1到5-13，选一些写到你的博客上Answer'''
SYSU - [专选]高级编程技术 - Week3, Lecture1 HW   
by Duan   
2018.03.19  
'''  


'''
5.3 外星人颜色#1
'''
alien_color = ['green', 'yellow', 'red']
alien = 'red'
print...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-2 Lecture-2]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79560100</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79560100</guid><author>SherryTuan</author><pubDate>Wed, 14 Mar 2018 21:14:14 +0800</pubDate><description><![CDATA[Question教材中课后的练习，4-1到4-15，选一些写到你的博客上Answer'''
SYSU - [专选]高级编程技术 - Week2, Lecture2 HW  
by Duan  
2018.03.14 
'''


'''
4-1 比萨：
想出至少三种你喜欢的比萨，将其名称存储在一个列表中，再使用 for 循环将每种比萨的名称都打
印出来。
1. 修改这个 for 循环，使其打印包含...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-2 Lecture-1]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79534417</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79534417</guid><author>SherryTuan</author><pubDate>Mon, 12 Mar 2018 23:11:46 +0800</pubDate><description><![CDATA[Question教材中课后的练习，3-1到3-11，选一些写到你的博客上Answer'''
SYSU - [专选]高级编程技术 - Week2, Lecture1 HW 
by Duan 
2018.03.12
'''  
  
  
'''
3-3 自己的列表：
想想你喜欢的通勤方式，如骑摩托车或开汽车，并创建一个包含多种通勤方式的列表。根据该列表打印
一系列有关这些通勤方式的宣言，如&quot;I wo...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW Week-1 Lecture-2]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79482751</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79482751</guid><author>SherryTuan</author><pubDate>Thu, 08 Mar 2018 13:13:42 +0800</pubDate><description><![CDATA[Question教材中课后的练习，2-1到2-11，选一些写到你的博客上Answer'''
SYSU - [专选]高级编程技术 - Week1, Lecture2 HW
by Duan
2018.03.08
'''


'''
2-1 简单消息：
将一条消息存储到变量中，再将其打印出来。
'''
message = &quot;This is a simple message!&quot;
print(message...]]></description><category></category></item><item><title><![CDATA[[SYSU][大二下] 高级编程技术HW  Week-1 Lecture-1]]></title><link>https://blog.youkuaiyun.com/SherryTuan/article/details/79451537</link><guid>https://blog.youkuaiyun.com/SherryTuan/article/details/79451537</guid><author>SherryTuan</author><pubDate>Mon, 05 Mar 2018 22:39:11 +0800</pubDate><description><![CDATA[Question浏览 Python 主页 ，在博客上写下你有哪些发现和收获。假设你已经称为一位 Python 编程高手，你打算实现怎样的程序？在博客上写下你的目标。Answer发现和收获：① 主页上不仅有面向 Python 初学者的 Beginner's Guide ，也有面向开发人员的 Developer's Guide ；② 有各种 Quiz 和 Exercise Questions（可在 B...]]></description><category></category></item></channel></rss>