Edit DistanceGiven two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You...
分类：
其他好文 时间：
2014-12-09 17:12:10
阅读次数：
240
Minimum Window SubstringGiven 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).Fo...
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...
分类：
其他好文 时间：
2014-12-08 23:10:51
阅读次数：
400
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 unkno...
分类：
其他好文 时间：
2014-12-08 23:09:33
阅读次数：
347
Minimum Window Substring
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 =...
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 ...
分类：
其他好文 时间：
2014-12-08 15:38:43
阅读次数：
141
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...
分类：
其他好文 时间：
2014-12-07 23:05:41
阅读次数：
137
Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol...
分类：
其他好文 时间：
2014-12-07 17:37:04
阅读次数：
110
实验设备：用虚拟机虚拟两个redhatlinux6.3-64bit系统，并配置好yumip设置：scsi服务端：10.1.1.222scsi客户端（挂载端）：10.1.1.1实验开始：1、在服务端安装软件并配置好共享的磁盘，首先在虚拟机中新加入一块硬盘，大小随意。（这里添加100G）[root@localhost~]#fdisk-l
Di..
分类：
系统相关 时间：
2014-12-07 06:56:08
阅读次数：
301
Palindrome Partitioning IIGiven a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for ...
分类：
其他好文 时间：
2014-12-06 22:52:25
阅读次数：
291
