摘要：
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 = "ADOBECODE... 阅读全文
posted @ 2014-05-11 22:48
linyx
阅读(449)
评论(0)
推荐(0)
摘要：
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message con... 阅读全文
posted @ 2014-05-11 20:08
linyx
阅读(189)
评论(0)
推荐(0)
摘要：
You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatena... 阅读全文
posted @ 2014-05-11 18:29
linyx
阅读(185)
评论(0)
推荐(0)
摘要：
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.You shoul... 阅读全文
posted @ 2014-05-11 01:19
linyx
阅读(186)
评论(0)
推荐(0)
浙公网安备 33010602011771号