LeetCode
关注
分享
扫一扫
文章平均质量分 68
AcceptedF
这个作者很懒，什么都没留下…
展开
-
【Leetcode-Java】101.Symmetric Tree
1.原题：链接：https://leetcode.com/problems/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,原创 2017-02-14 17:26:33 · 252 阅读 · 0 评论 -
【LeetCode-Java】54. Spiral Matrix+59. Spiral Matrix II
54. Spiral Matrix：1.原题链接：https://leetcode.com/problems/spiral-matrix/Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example原创 2017-02-15 10:37:15 · 438 阅读 · 0 评论 -
【LeetCode-Java】155. Min Stack
1.原题链接：https://leetcode.com/problems/min-stack/Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() --原创 2017-02-15 11:35:48 · 366 阅读 · 0 评论 -
【Leetcode-Java】102. Binary Tree Level Order Traversal
1.原题链接：https://leetcode.com/problems/binary-tree-level-order-traversal/Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).原创 2017-02-15 16:18:47 · 307 阅读 · 0 评论