stack
Goofiness
这个作者很懒,什么都没留下…
展开
-
[LeetCode]Minimum Cost Tree From Leaf Values@Golang
Minimum Cost Tree From Leaf ValuesGiven an array arr of positive integers, consider all binary trees such that:Each node has either 0 or 2 children;The values of arr correspond to the values of eac...原创 2019-11-05 16:35:58 · 175 阅读 · 0 评论 -
[LeetCode]Remove K Digits@Python
Remove K DigitsGiven a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.Note:The length of num is less than 10002 an...原创 2019-06-09 01:25:41 · 128 阅读 · 0 评论 -
[LeetCode]Flatten Nested List Iterator@Python
Flatten Nested List IteratorGiven 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.Ex...原创 2019-06-09 00:55:08 · 155 阅读 · 0 评论 -
[LeetCode]Verify Preorder Serialization of a Binary Tree@Python
Verify Preorder Serialization of a Binary TreeOne way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node’s value. If it is a null node, we...原创 2019-06-08 23:22:59 · 140 阅读 · 0 评论 -
[LeetCode]132 Pattern@Python
132 PatternGiven a sequence of n integers a1, a2, …, an, a 132 pattern is a subsequence ai, aj, ak such that i < j < k and ai < ak < aj. Design an algorithm that takes a list of n numbers...原创 2019-06-08 22:09:27 · 211 阅读 · 0 评论 -
[LeetCode]Evaluate Reverse Polish Notation@Python
Evaluate Reverse Polish NotationEvaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Note:...原创 2019-05-29 21:12:24 · 166 阅读 · 0 评论 -
[LeetCode]Decode String@Python
Decode StringGiven an encoded string, return it’s decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note ...原创 2019-06-01 21:06:46 · 187 阅读 · 0 评论 -
[LeetCode]Binary Tree Postorder Traversale@Python
Binary Tree Postorder TraversalGiven a binary tree, return the postorder traversal of its nodes’ values.ExampleInput: [1,null,2,3]Output: [3,2,1]Solution#Recursivelyclass Solution: def ...原创 2019-05-28 23:34:21 · 77 阅读 · 0 评论 -
Binary Tree Inorder Traversal
Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes’ values.ExampleInput: [1,null,2,3]Output: [1,3,2]Solution# recursivelyclass Solution: def ino...原创 2019-05-23 23:59:56 · 59 阅读 · 0 评论 -
[LeetCode]Binary Search Tree Iterator@Python
Binary Search Tree IteratorImplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.Calling next() will return the next smallest number i...原创 2019-05-30 21:37:01 · 96 阅读 · 0 评论 -
[LeetCode]Binary Tree Preorder Traversal@Python
Binary Tree Preorder TraversalGiven a binary tree, return the preorder traversal of its nodes’ values.ExampleInput: [1,null,2,3]Output: [1,2,3]Solution# Recursivelyclass Solution: def p...原创 2019-05-27 22:09:42 · 157 阅读 · 0 评论 -
[LeetCode]Backspace String Compare@Python
Backspace String CompareGiven two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character.ExampleInput: S = “ab#c”, T = “ad#c”Output...原创 2019-05-23 00:57:56 · 162 阅读 · 0 评论 -
[LeetCode]Binary Tree Zigzag Level Order Traversal@Python
Binary Tree Zigzag Level Order TraversalGiven a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternat...原创 2019-05-26 22:48:35 · 172 阅读 · 1 评论 -
[LeetCode]Simplify Path@Python
Simplify PathGiven an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.In a UNIX-style file system, a period . refers to the current directory...原创 2019-05-22 10:41:24 · 98 阅读 · 0 评论