2020年1月14日
[LeetCode] 559. Maximum Depth of N-ary Tree
摘要： Given a n-ary 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 le 阅读全文
posted @ 2020-01-14 14:40 CNoodle 阅读(150) 评论(0) 推荐(0)
[LeetCode] 506. Relative Ranks
摘要： You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be u 阅读全文
posted @ 2020-01-14 02:39 CNoodle 阅读(249) 评论(0) 推荐(0)
[LeetCode] 513. Find Bottom Left Tree Value
摘要： Given the root of a binary tree, return the leftmost value in the last row of the tree. Example 1: Input: root = [2,1,3] Output: 1 Example 2: Input: r 阅读全文
posted @ 2020-01-14 01:44 CNoodle 阅读(170) 评论(0) 推荐(0)