![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LintCode
文章平均质量分 67
yuanhisn
这个作者很懒,什么都没留下…
展开
-
LintCode - Infix to Postfix / Convert Expression to Reverse Polish Notation
Given an expression string array, return the Reverse Polish notation of this expression. (remove the parentheses)Aka, convert infix notation to postfix notation. ExampleFor the expression [...原创 2015-06-01 00:09:54 · 91 阅读 · 0 评论 -
LintCode - Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.ExampleGiven the array [2,3,1,...原创 2015-06-04 10:35:16 · 63 阅读 · 0 评论 -
LintCode - Subarray Sum Zero
Given an integer array, find a subarray where the sum of numbers is zero. Your code should return the index of the first number and the index of the last number.ExampleGiven [-3, 1, 2, -3, 4]...原创 2015-06-04 11:01:39 · 53 阅读 · 0 评论 -
LintCode - Search Range in Binary Search Tree
Given two values k1 and k2 (where k1 < k2) and a root pointer to a Binary Search Tree. Find all the keys of tree in range k1 to k2. i.e. print all x such that k1<=x<=k2 and x is a key of gi...原创 2015-07-30 23:52:45 · 59 阅读 · 0 评论