fd

Author: dingjikerbo

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

@@ -13,7 +13,6 @@
 
 /**
  * 有三种解法：
- * 1，中序完整遍历一遍二叉树形成一个list，再找到最接近target的node，然后依次往左右两边延伸到找满k个节点，复杂度O(n + lgn + k)
  * 2，中序遍历两遍二叉树，不过每次都会中途退出，构成双栈，一个是大于target，一个是小于target，然后依次出栈满k为止，复杂度O(n + k)
  * 3，中序完整遍历一遍二叉树，依次将节点加入优先级队列，按与target的差排序，选前k个，复杂度O(nlgk)
  */

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

@@ -17,6 +17,7 @@
 public class InorderSuccessorInBST {
 
     // 耗时10ms
+    // 时间复杂度O(n)
     public TreeNode inorderSuccessor(TreeNode root, TreeNode p) {
         Stack<TreeNode> stack = new Stack<TreeNode>();
         TreeNode node = null, prev = null;

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

@@ -1,5 +1,6 @@
 package com.inuker.test;
 
+import com.leetcode.library.Interval;
 import com.leetcode.library.TreeNode;
 
 import java.util.ArrayList;
@@ -21,26 +22,6 @@
 public class main {
 
     public static void main(String[] args) {
-    }
 
-    public int[] maxSlidingWindow(int[] nums, int k) {
-        if (nums.length == 0 || k == 0) {
-            return new int[0];
-        }
-        int[] result = new int[nums.length - k + 1];
-        Deque<Integer> queue = new LinkedList<>();
-        for (int i = 0; i < nums.length; i++) {
-            while (!queue.isEmpty() && nums[i] > nums[queue.peekLast()]) {
-                queue.pollLast();
-            }
-            queue.offerLast(i);
-            if (queue.peekFirst() + k <= i) {
-                queue.pollFirst();
-            }
-            if (i - k + 1 >= 0) {
-                result[i - k + 1] = nums[queue.peekFirst()];
-            }
-        }
-        return result;
     }
 }