fd

Author: dingjikerbo

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

@@ -1,6 +1,7 @@
 package com.inuker.solution;
 
 import java.util.Collections;
+import java.util.Comparator;
 import java.util.PriorityQueue;
 
 /**
@@ -17,7 +18,7 @@ public class FindMedianFromDataStream {
     /**
      * 比较小的一半
      */
-    PriorityQueue<Integer> minheap = new PriorityQueue<Integer>(Collections.reverseOrder());
+    PriorityQueue<Integer> minheap = new PriorityQueue<Integer>(Comparator.reverseOrder());
 
     // Adds a number into the data structure.
     public void addNum(int num) {

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

@@ -29,21 +29,4 @@ public static void main(String[] args) {
         test.call("hello");
         test.call("how");
     }
-
-    public int lengthOfLongestSubstringKDistinct(String s, int k) {
-        int longest = 0;
-        int[] dp = new int[256];
-        for (int i = 0, j = 0, n = 0; j < s.length(); j++) {
-            char c = s.charAt(j);
-            if (dp[c]++ == 0) {
-                for (++n; i <= j && n > k; i++) {
-                    if (--dp[s.charAt(i)] == 0) {
-                        n--;
-                    }
-                }
-            }
-            longest = Math.max(longest, j - i + 1);
-        }
-        return longest;
-    }
 }