fd

Author: dingjikerbo

solution/src/main/java/com/inuker/solution/MinimumWindowSubstring.java

@@ -8,43 +8,30 @@ public class MinimumWindowSubstring {
 
     // 耗时8ms，时间复杂度O(n)
     public String minWindow(String s, String t) {
-        int[] sc = new int[256], tc = new int[256];
-
+        int[] tc = new int[256], sc = new int[256];
         for (char c : t.toCharArray()) {
             tc[c]++;
         }
-
-        int minStart = 0, minLen = Integer.MAX_VALUE;
-
-        for (int i = 0, j = 0, k = 0; j < s.length(); j++) {
+        int count = 0, min = Integer.MAX_VALUE, start = 0;
+        for (int i = 0, j = 0; j < s.length(); j++) {
             char c = s.charAt(j);
-
             if (++sc[c] <= tc[c]) {
-                ++k;
+                ++count;
             }
-
-            if (k == t.length()) {
-                for (; i < j; i++) {
+            if (count == t.length()) {
+                for ( ; i < j; i++) {
                     char cc = s.charAt(i);
-
-                    if (tc[cc] == 0) {
-                        continue;
-                    }
-
                     if (sc[cc] <= tc[cc]) {
                         break;
                     }
-
                     sc[cc]--;
                 }
-
-                if (j - i + 1 < minLen) {
-                    minLen = j - i + 1;
-                    minStart = i;
+                if (j - i + 1 < min) {
+                    min = j - i + 1;
+                    start = i;
                 }
             }
         }
-
-        return minLen != Integer.MAX_VALUE ? s.substring(minStart, minStart + minLen) : "";
+        return min == Integer.MAX_VALUE ? "" : s.substring(start, start + min);
     }
 }

test/src/main/java/com/inuker/test/main.java

@@ -28,21 +28,34 @@
 public class main {
 
     public static void main(String[] args) {
-        System.out.println(isPalindrome(10));
+        System.out.println(minWindow("ADOBECODEBANC", "ABC"));
     }
 
-    public static boolean isPalindrome(int x) {
-        if (x < 0) {
-            return false;
+    public static String minWindow(String s, String t) {
+        int[] tc = new int[256], sc = new int[256];
+        for (char c : t.toCharArray()) {
+            tc[c]++;
         }
-        int t = 1;
-        for (; t <= x / 10; t *= 10);
-
-        for (int k = 1; t > k; t /= 10, k *= 10) {
-            if ((x / t) % 10 != (x / k) % 10) {
-                return false;
+        int count = 0, min = Integer.MAX_VALUE, start = 0;
+        for (int i = 0, j = 0; j < s.length(); j++) {
+            char c = s.charAt(j);
+            if (++sc[c] <= tc[c]) {
+                ++count;
+            }
+            if (count == t.length()) {
+                for ( ; i < j; i++) {
+                    char cc = s.charAt(i);
+                    if (sc[cc] <= tc[cc]) {
+                        break;
+                    }
+                    sc[cc]--;
+                }
+                if (j - i + 1 < min) {
+                    min = j - i + 1;
+                    start = i;
+                }
             }
         }
-        return true;
+        return min == Integer.MAX_VALUE ? "" : s.substring(start, start + min);
     }
 }