RocZhang的博客

76. 最小覆盖子串 leetcode 刷题笔记。 完整题解： public class demo76 { public static void main(String[] args) { demo76 demo76 = new demo76(); String s = demo76.minWindow("abaacbab", "abc"); System.out.println("最小子字符串是：" + s); } Map<C

二分查找框架 int binarySearch(int[] nums, int target) { int left = 0, right = ...; while (...) { if (nums[mid] == target) { ... } else if (nums[mid] < target) { left = ...; } else if (nums[mid] > target) { righ