摘要：
Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they a 阅读全文
posted @ 2020-01-07 03:36
CNoodle
阅读(495)
评论(0)
推荐(0)
摘要：
Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root n 阅读全文
posted @ 2020-01-07 02:55
CNoodle
阅读(470)
评论(0)
推荐(0)
摘要：
Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3].... Example: Input: nums = [3,5,2,1,6,4] Output: 阅读全文
posted @ 2020-01-07 02:36
CNoodle
阅读(141)
评论(0)
推荐(0)
浙公网安备 33010602011771号