lwgkzl的博客

Jessica's Reading Problem Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11226   Accepted: 3777 Description Jessica's a very lovely girl wooed by lots of

Subsequence Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 13114   Accepted: 5537 Description A sequence of N positive integers (10 < N < 100 000), each o

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6206    Accepted Submission(s): 1732 Problem Description Hassan is in trouble. His

题目如下： A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the le

题目： 给定一个字符串 S 和一个字符串 T，请在 S 中找出包含 T 所有字母的最小子串。 示例： 输入: S = "ADOBECODEBANC", T = "ABC" 输出: "BANC" 说明： 如果 S 中不存这样的子串，则返回空字符串 ""。 如果 S 中存在这样的子串，我们保证它是唯一的答案。 坑点： 1.在S中找到包含T中所有字母的子串，这个子串并不仅仅是要包含所有T...