码迷,mamicode.com
首页 > Windows程序 > 详细

Minimum Window Substring

时间:2016-07-16 06:59:45      阅读:249      评论:0      收藏:0      [点我收藏+]

标签:

Given a string source and a string target, find the minimum window in source which will contain all the characters in target.

 Notice

If there is no such window in source that covers all characters in target, return the emtpy string "".

If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in source.

Clarification

Should the characters in minimum window has the same order in target?

  • Not necessary.
Example

For source = "ADOBECODEBANC", target = "ABC", the minimum window is"BANC"

分析:
用两个指针,start, end. 我们首先移动end,使得start 和end中间部分能够完全cover target,当我们移动end,再次找到一个target中含有的character,我们就看是否可以移动start,使得start和end之间的距离变小,而且还是能够cover target中的所有字符。如果可以,那么我们就保存。
 1 public class Solution {
 2     /**
 3      * @param source: A string
 4      * @param target: A string
 5      * @return: A string denote the minimum window
 6      *          Return "" if there is no such a string
 7      */
 8     public String minWindow(String source, String target) {
 9         if (source == null || target == null || source.length() < target.length())
10             return "";
11 
12         int count = 0;
13         int[] targetCharCounts = new int[256];
14         int[] allAppeared = new int[256];
15         int start = -1;
16         int end = - 1;
17 
18         String minString = "";
19 
20         for (int i = 0; i < target.length(); i++) {
21             targetCharCounts[target.charAt(i)]++;
22         }
23 
24         for (int i = 0; i < source.length(); i++) {
25             if (targetCharCounts[source.charAt(i)] >= 1) { // character we need
26                 if (start == -1) {
27                     start = i;
28                 }
29 
30                 allAppeared[source.charAt(i)]++;
31                 if (targetCharCounts[source.charAt(i)] >= allAppeared[source.charAt(i)]) {
32                     count++;
33                 }
34 
35                 if (count == target.length() && end == -1) {
36                     end = i;
37                     minString = source.substring(start, end + 1);
38                 }
39                 // decrease the window size
40                 while (start < source.length() && (targetCharCounts[source.charAt(start)] == 0
41                         || allAppeared[source.charAt(start)] > targetCharCounts[source.charAt(start)])) {
42                     if (allAppeared[source.charAt(start)] > 0) {
43                         allAppeared[source.charAt(start)]--;
44                     }
45                     start++;
46                 }
47 
48                 if (i - start + 1 < minString.length() && count == target.length()) {
49                     end = i;
50                     minString = source.substring(start, end + 1);
51                 }
52             }
53         }
54         return minString;
55     }
56 }

 

Minimum Window Substring

标签:

原文地址:http://www.cnblogs.com/beiyeqingteng/p/5675204.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!