2018年10月10日
590. N-ary Tree Postorder Traversal
摘要： 590. N-ary Tree Postorder Traversal Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary tree: Return 阅读全文
posted @ 2018-10-10 01:27 hopskin1 阅读(194) 评论(0) 推荐(0)
700. Search in a Binary Search Tree
摘要： 700. Search in a Binary Search Tree Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node' 阅读全文
posted @ 2018-10-10 01:21 hopskin1 阅读(149) 评论(0) 推荐(0)
885. Spiral Matrix III
摘要： On a 2 dimensional grid with R rows and C columns, we start at (r0, c0) facing east. Here, the north-west corner of the grid is at the first row and c 阅读全文
posted @ 2018-10-10 01:04 hopskin1 阅读(200) 评论(0) 推荐(0)