![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode刷题
Arno_Pei
一辈子很长,要和有趣的人在一起!
展开
-
[LeetCode]101 - Symmetric Tree - 判断对称树(easy) - python
problem description:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric:[1,2,2,4,3,3,4]But the following is no...原创 2019-02-23 20:34:43 · 206 阅读 · 0 评论 -
[LeetCode]1 - Two Sum(easy) - python
problem description:Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you m...原创 2019-02-28 09:59:35 · 178 阅读 · 0 评论 -
[LeetCode]104 - Maximum Depth of Binary Tree(easy) - python
problem description:Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Note: A leaf is a n...转载 2019-02-27 09:24:49 · 290 阅读 · 0 评论