LeetCode
云聪
喜欢简洁的抽象,也着迷神奇的细节,我担心自己因为过于偏向抽象而变得肤浅,也害怕自己因为太过深入细节而迷失,这让我很痛苦,但是我不会放弃挣扎,因为我相信挣扎的过程就是成长。
展开
-
LeetCode31 Next Permutation
题目:Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.原创 2015-09-26 22:29:48 · 562 阅读 · 0 评论 -
LeetCode341 Flatten Nested List Iterator(迭代器模式实践) Java
题目: Given a nested list of integers, implement an iterator to flatten it.Each element is either an integer, or a list – whose elements may also be integers or other lists.Example 1: Given the list [[原创 2016-04-20 20:00:17 · 5596 阅读 · 0 评论 -
LeetCode145 Binary Tree Postorder Traversal(迭代实现) Java
题目: Given a binary tree, return the postorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1].原创 2016-04-21 18:57:23 · 1159 阅读 · 0 评论 -
LeetCode94 Binary Tree Inorder Traversal(迭代实现) Java
题目: Given a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2]. 分析: 中根遍历二叉树...原创 2016-04-22 21:05:06 · 1059 阅读 · 0 评论 -
LeetCode208 Implement Trie (Prefix Tree) Java
题目: Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs are consist of lowercase letters a-z. 分析: 对于一棵存储字单词的前缀树,是这样的:树的根结点是空的,其它非叶子节点中存储着一个字符,叶子节点是一个哨兵...原创 2016-04-22 21:59:48 · 916 阅读 · 0 评论 -
LeetCode335 Self Crossing Java
题目 You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] metres to the south, x[3] metres to the east ...原创 2016-04-17 12:32:05 · 771 阅读 · 0 评论 -
LeetCode144 Binary Tree Preorder Traversal(迭代实现) Java
题目: Given a binary tree, return the preorder traversal of its nodes’ values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive solution is trivial...原创 2016-04-23 13:14:19 · 2390 阅读 · 0 评论 -
LeetCode102 Binary Tree Level Order Traversal Java
题目: Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).原创 2016-04-23 14:20:55 · 3801 阅读 · 0 评论