排序:
默认
按更新时间
按访问量

LeetCode 340. Longest Substring with At Most K Distinct Characters(java)

Given a string, find the length of the longest substring T that contains at most k distinct characters.For example, Given s = “eceba” and k = 2,T is ...

2018-02-12 11:49:48

阅读数:55

评论数:0

LeetCode 159. Longest Substring with At Most Two Distinct Characters(java)

Given a string, find the length of the longest substring T that contains at most 2 distinct characters.For example, Given s = “eceba”,T is "ece&...

2018-02-12 11:45:26

阅读数:46

评论数:0

LeetCode 76. Minimum Window Substring(java)

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 = "AD...

2018-02-12 11:41:53

阅读数:22

评论数:0

LeetCode 53. Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,...

2018-02-12 09:17:36

阅读数:28

评论数:0

LeetCode 3. Longest Substring Without Repeating Characters(java)

Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc&qu...

2018-02-12 02:08:43

阅读数:30

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭