import java.util.*;

/**
* Source : https://oj.leetcode.com/problems/substring-with-concatenation-of-all-words/
*
* Created by lverpeng on 2017/7/13.
*
* You are given a string, S, and a list of words, L, that are all of the same length.
* Find all starting indices of substring(s) in S that is a concatenation of each word
* in L exactly once and without any intervening characters.
*
* For example, given:
* S: "barfoothefoobarman"
* L: ["foo", "bar"]
*
* You should return the indices: [0,9].
* (order does not matter).
*
*
* 找出L中单词连接成的子串在字符串S中出现所有位置
*
*/
public class SubstringWithConcatenationOfAllWords { /**
*
* 将strArr中的所有单词放在hash表中,单词为key,相同单词出现的次数为value
*
* strArr中所有单词长度一致,S重要出现所有单词的连接成为的字符串,那么S的长度一定要大于strArr中所有单词的总长度,
* 也就是起始字符在0-(S.length - strArr.length * strArr[0].length)之间,
* 以上面的位置为起始位置,依次判断接下来的strArr.length个单词是否正好是上面hash表中的单词,并判断相同单词出现次数,
* 如果没有出现则退出循环,如果出现的次数大于hash表中单词的次数也break
* 一轮循环完成之后判断循环的次数是否正好是strArr.length,如果是,说明S包含strArr连接的字符串,记录此时的起始位置到结果中
*
* @param S
* @param strArr
* @return
*/
public int[] findSubstring (String S, String[] strArr) {
if (S.length() < 1 | strArr.length < 1) {
return new int[]{};
}
Map<String, Integer> wordMap = new HashMap<String, Integer>(); // 存放strArr单词的哈希表 for (String str : strArr) {
if (wordMap.keySet().contains(str)) {
wordMap.put(str, wordMap.get(str) + 1);
} else {
wordMap.put(str, 1);
}
} int loopCount = 0;
int arrLen = strArr.length;
int wordLen = strArr[0].length();
int arrStrLen = arrLen * wordLen;
List<Integer> result = new ArrayList<Integer>();
for (int i = 0; i < S.length() - arrStrLen; i++) {
int j = 0;
Map<String, Integer> subStrMap = new HashMap<String, Integer>();
for (j = 0; j < arrLen; j++) {
loopCount ++;
String subStr = S.substring(i + j * wordLen, i + j * wordLen + wordLen);
if (!wordMap.keySet().contains(subStr)) {
break;
} else {
if (subStrMap.keySet().contains(subStr)) {
subStrMap.put(subStr, subStrMap.get(subStr) + 1);
} else {
subStrMap.put(subStr, 1);
}
}
if (subStrMap.get(subStr) > wordMap.get(subStr)) {
break;
}
} if (j == arrLen) {
result.add(i);
} }
System.out.println("loopCount------->" + loopCount);
int[] res = new int[result.size()];
for (int i = 0; i < result.size(); i++) {
res[i] = result.get(i);
}
return res;
} /**
* 上面是以步长为1进行循环,下面以步长为word长度进行循环
*
* @param S
* @param strArr
* @return
*/
public int[] findSubstring1 (String S, String[] strArr) {
if (S.length() < 1 || strArr.length < 1) {
return new int[]{};
}
Map<String, Integer> wordMap = new HashMap<String, Integer>();
for (int i = 0; i < strArr.length; i++) {
if (wordMap.keySet().contains(strArr[i])) {
wordMap.put(strArr[i], wordMap.get(strArr[i]));
} else {
wordMap.put(strArr[i], 1);
}
} List<Integer> result = new ArrayList<Integer>();
int wordLen = strArr[0].length();
Map<String, Integer> subStrMap = new HashMap<String, Integer>(); int loopCount = 0;
for (int i = 0; i < wordLen; i++) {
int count = 0;
int left = i; // 记录待匹配子串起始位置
for (int j = i; j < S.length() - wordLen; j += wordLen) {
loopCount ++;
String subStr = S.substring(j, j + wordLen);
if (wordMap.keySet().contains(subStr)) {
if (subStrMap.keySet().contains(subStr)) {
subStrMap.put(subStr, subStrMap.get(subStr) + 1);
} else {
subStrMap.put(subStr, 1);
}
count ++;
if (subStrMap.get(subStr) <= wordMap.get(subStr)) {
count ++;
} else {
// 说明当前开始位置不匹配
while (subStrMap.get(subStr) > wordMap.get(subStr)) {
//
String startWord = S.substring(left, left + wordLen);
subStrMap.put(startWord, subStrMap.get(startWord) - 1);
left += wordLen;
count --;
}
}
if (count == strArr.length) {
// 找到了
result.add(left); // 向后移动一个单词
count --;
String startWord = S.substring(left, left + wordLen);
subStrMap.put(startWord, subStrMap.get(startWord) - 1);
left += wordLen; }
} else {
// 清空变量,重新开始查找
left = j + wordLen;
subStrMap.clear();
count = 0;
}
}
} System.out.println("loopCount------->" + loopCount); int[] res = new int[result.size()];
for (int i = 0; i < result.size(); i++) {
res[i] = result.get(i);
}
return res; } public static void main(String[] args) {
SubstringWithConcatenationOfAllWords substringWithConcatenationOfAllWords = new SubstringWithConcatenationOfAllWords();
String S = "barfoothefoobarman";
String[] strArr = new String[]{"foo", "bar"}; System.out.println(Arrays.toString(substringWithConcatenationOfAllWords.findSubstring(S, strArr)));
System.out.println(Arrays.toString(substringWithConcatenationOfAllWords.findSubstring1(S, strArr)));
} }

leetcode — substring-with-concatenation-of-all-words的更多相关文章

  1. LeetCode: Substring with Concatenation of All Words 解题报告

    Substring with Concatenation of All Words You are given a string, S, and a list of words, L, that ar ...

  2. [LeetCode] Substring with Concatenation of All Words 串联所有单词的子串

    You are given a string, s, and a list of words, words, that are all of the same length. Find all sta ...

  3. LeetCode:Substring with Concatenation of All Words (summarize)

    题目链接 You are given a string, S, and a list of words, L, that are all of the same length. Find all st ...

  4. [leetcode]Substring with Concatenation of All Words @ Python

    原题地址:https://oj.leetcode.com/problems/substring-with-concatenation-of-all-words/ 题意: You are given a ...

  5. Leetcode Substring with Concatenation of All Words

    You are given a string, S, and a list of words, L, that are all of the same length. Find all startin ...

  6. [LeetCode] Substring with Concatenation of All Words(good)

    You are given a string, S, and a list of words, L, that are all of the same length. Find all startin ...

  7. Leetcode:Substring with Concatenation of All Words分析和实现

    题目大意是传入一个字符串s和一个字符串数组words,其中words中的所有字符串均等长.要在s中找所有的索引index,使得以s[index]为起始字符的长为words中字符串总长的s的子串是由wo ...

  8. LeetCode()Substring with Concatenation of All Words 为什么我的超时呢?找不到原因了!!!

    超时代码 class Solution { public: vector<int> findSubstring(string s, vector<string>& wo ...

  9. LeetCode HashTable 30 Substring with Concatenation of All Words

    You are given a string, s, and a list of words, words, that are all of the same length. Find all sta ...

  10. leetcode面试准备: Substring with Concatenation of All Words

    leetcode面试准备: Substring with Concatenation of All Words 1 题目 You are given a string, s, and a list o ...

随机推荐

  1. SSD性能测试第一神器:FIO

    SSD性能测试第一神器:FIO  2017年8月12日 syswift 0 对于SSD性能测试来说,最好的工具莫过于FIO了. 上面这个可爱的小伙子名字叫Jens Axboe,他是丹麦哥本哈根大学计算 ...

  2. ubuntu中运行java程序

    查找jdk rivsidn@rivsidn:~/demo/java$ sudo apt-cache search jdk default-jdk - Standard Java or Java com ...

  3. Python之路(第二十九篇) 面向对象进阶:内置方法补充、异常处理

    一.__new__方法 __init__()是初始化方法,__new__()方法是构造方法,创建一个新的对象 实例化对象的时候,调用__init__()初始化之前,先调用了__new__()方法 __ ...

  4. 第四次spring会议

    昨天:对TXT的字体颜色和背景进行了代码编写. 出现的问题:在网上找到如何编写代码后,自己打进去了,输出不出来.少打了一个空格在EventArgs e之间. 今天将做之事: 我设置上换肤和透明度等功能 ...

  5. SAS数据集

    SAS数据集是存储在SAS逻辑库中.由SAS创建和处理的SAS文件,是SAS存储数据的主要方式.SAS数据集包含以表的观测(行)和 变量(列)为形式存在的数据值,以及用以描述变量类型.长度和创建该数据 ...

  6. springboot 初始化 web 项目 启动报错。。。一直解决不了

    1. 一个简单的SpringBoot项目,启动时报错信息: ERROR 18688 --- [cat-startStop-1] org.apache.catalina.core.ContainerBa ...

  7. centos7 编译安装nginx+tcp转发

    一.依赖 1. gcc 安装安装 nginx 需要先将官网下载的源码进行编译,编译依赖 gcc 环境,如果没有 gcc 环境,则需要安装: yum install gcc-c++ 2. PCRE pc ...

  8. form表单数据进行json转换

    $.fn.serializeJson = function() { var o = {}; var a = this.serializeArray(); $.each(a, function() { ...

  9. kubernetes中filebeat以sidecar方式和应用一起部署,并且传入环境变量

    本文的环境介绍 [root@m-30-1 ~]# kubectl version Client Version: version.Info{Major:"1", Minor:&qu ...

  10. git代码同步服务器代码需要注意的问题

    魔鬼藏在细节之中,git代码同步服务器代码需要注意的问题 1. 全文件夹覆盖  git pull 当前文件夹 2. 覆盖前做代码备份  mv origin origin_20190404_bak