[Java 101] 76.
class Solution { public String minWindow(String s, String t) { String ret = null; Set<Character> charSet = t.chars().mapToObj(c -> (char) c) .collect(Collectors.toSet()); List<Integer> indexList = new ArrayList<>(); Map<Character, Integer> need = new HashMap<>(); for (int i=0; i<s.length(); i++) { Character c = s.charAt(i); if (charSet.contains(c)) { indexList.add(i); } } for (int i=0; i<t.length(); i++) { … Read more