Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get ...
分类：
其他好文 时间：
2015-04-02 21:00:58
阅读次数：
104
problem：
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which
minimizes the sum of all numbers along its path.
Note: You can only move e...
分类：
其他好文 时间：
2015-04-02 16:27:56
阅读次数：
131
1 Given an integer array, adjust each integers so that the difference of every adjcent integers are not greater than a given number target.2 3 If the ...
分类：
其他好文 时间：
2015-04-02 06:37:00
阅读次数：
120
Find the nth to last element of a singly linked list. The minimum number of nodes in list is n.ExampleGiven a List 3->2->1->5->null and n = 2, return....
分类：
其他好文 时间：
2015-04-02 06:34:52
阅读次数：
101
1554: SG ValueTime Limit:5 SecMemory Limit:256 MBSubmit:140Solved:35DescriptionThe SG value of a set (multiset) is the minimum positive integer that c...
分类：
其他好文 时间：
2015-04-01 23:14:14
阅读次数：
107
RMQ问题，全名(Range Minimum/Maximum Query)，是求给定区间中的最值问题。
主要方法及复杂度如下：
1、朴素（即搜索），O(n)-O(qn) online。
2、线段树，O(n)-O(qlogn) online。
3、Sparse_Table（实质是动态规划），O(nlogn)-O(1) online。
4、RMQ标准算法：先规约成LCA（Lowest C...
分类：
编程语言 时间：
2015-04-01 17:43:37
阅读次数：
174
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m...
分类：
其他好文 时间：
2015-04-01 17:12:31
阅读次数：
134
打开终端输入xrandr得到如下信息Screen 0: minimum 320 x 200, current 2390 x 768, maximum 8192 x 8192LVDS connected primary 1366x768+1024+0 (normal left inverted rig...
分类：
系统相关 时间：
2015-04-01 16:59:57
阅读次数：
219
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2.
(each operation is counted as 1 step.)
You have the following 3 operations permitted on a word:...
分类：
其他好文 时间：
2015-04-01 11:29:06
阅读次数：
143
题目：
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).
For example,
S = "ADOBECODEBANC"
T = "ABC"
Minimum windo...
