摘要: 1. 串联所有单词的子串(30) 思想: 哈希表+滑动窗口 class Solution { public List<Integer> findSubstring(String s, String[] words) { int len = words.length; int wordlen = wo 阅读全文
posted @ 2023-10-11 22:14 forever_fate 阅读(10) 评论(0) 推荐(0)