LeetCode第七天

星期日做老师给的任务去了，就没有做着一块，以后尽量还是要做

104. 二叉树的最大深度

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if(root==None):
            return 0
        return max(self.maxDepth(root.left),self.maxDepth(root.right))+1

特别开心，因为这个函数是自己想出来的，没有借鉴别人的思路

107. 二叉树的层次遍历 II

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
import queue
class Solution:
    def levelOrderBottom(self, root):
        """
        :type root: TreeNode
        :rtype: List[List[int]]
        """
        if(root==None):
            return []
        q=queue.Queue()
        q.put([root])
        data_list=[]
        while(q.empty()==False):
            data,temp=[],[]
            m=q.get()
            for i in range(len(m)):
                data.append(m[i].val)
                if(m[i].left):
                    temp.append(m[i].left)
                if(m[i].right):
                    temp.append(m[i].right)
            data_list.append(data)
            if(temp!=[]):
                q.put(temp)
        data_list.reverse()  
        return data_list   

这个也是！！！今天非常非常开心，虽然去游泳感冒了，但是写起代码来好像就没那么难受！