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-01-16 19:15:26
阅读次数：
177
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...
分类：
其他好文 时间：
2015-01-16 18:22:29
阅读次数：
136
题意是求逆序数。
先无脑用线段树求出原数列的逆序数。
然后：
不过是把一个数列的第一个数放到最后。这样重复n-1次。在新数列中找出最小的逆序数。
假如第一个数是 a[i] 那么放到最后之后，新数列的逆序数为原数列的逆序数减去比 a[i]小的数，加上比 a[i]大的数。
即 ans=ans-2*a[i]+n-1; 这样就必须把输入的数列存下来。
#include
#i...
分类：
其他好文 时间：
2015-01-16 16:51:22
阅读次数：
187
标题：Min Stack通过率：15.2%难度：简单Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x o...
分类：
其他好文 时间：
2015-01-16 16:26:28
阅读次数：
156
Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Suppose a sorted array is rotated at some pivot u...
分类：
其他好文 时间：
2015-01-15 22:14:10
阅读次数：
166
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4
5 6 7 0 1 2).
Find the minimum element.
You may assume no duplicate exists in ...
分类：
其他好文 时间：
2015-01-15 22:13:10
阅读次数：
176
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-01-15 22:12:22
阅读次数：
150
Selection in expected linear time
The general selection problem appears more difficult than the simple problem of finding a minimum. Yet, surprisingly, the asymptotic running tim...
分类：
其他好文 时间：
2015-01-15 14:21:23
阅读次数：
185
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 either down or right at...
分类：
其他好文 时间：
2015-01-15 09:28:07
阅读次数：
124
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
For example, given the following triangle
[
[2],
[3,4],
[...
分类：
其他好文 时间：
2015-01-14 22:53:47
阅读次数：
153
