2017 年 7月 21 日随笔档案 - Beserious

2017年7月21日

摘要： 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 l 阅读全文

posted @ 2017-07-21 18:13 Beserious 阅读(114) 评论(0) 推荐(0)

101. Symmetric Tree

摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文

posted @ 2017-07-21 17:54 Beserious 阅读(130) 评论(0) 推荐(0)

100. Same Tree

摘要： Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical a 阅读全文

posted @ 2017-07-21 15:53 Beserious 阅读(131) 评论(0) 推荐(0)

88. Merge Sorted Array

摘要： Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size tha 阅读全文

posted @ 2017-07-21 15:29 Beserious 阅读(104) 评论(0) 推荐(0)