Substring with Concatenation of All Words

最新推荐文章于 2024-01-06 14:27:05 发布

原创最新推荐文章于 2024-01-06 14:27:05 发布 · 333 阅读

0 ·

CC 4.0 BY-SA版权

Linux 同时被 2 个专栏收录

383 篇文章

订阅专栏

C++算法系列

256 篇文章

订阅专栏

本文介绍了一个使用 C++ 实现的算法，该算法用于找出字符串中由指定单词列表组成的所有子串的起始索引。通过全排列的方式组合单词列表，并在目标字符串中搜索这些组合形成的子串。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <stdint.h>
#include <sys/wait.h>
#include <limits.h>
#include <time.h>
#include <pthread.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <queue>
#include <sstream>
#include <iterator>
#include <algorithm>
#include <thread>
using namespace std;
vector<int> &findSubstring(const string &s, vector<string>&words) 
{
	int i;
	string line;
	static vector<int>indices;
	vector<int>tmpvec;

        indices.clear();
	if(s.empty()) 
	{
		cerr << "s is none...!" << endl;
		return indices;
	}
	int size = words.size();
	if(!size) 
	{
		cerr << "words is none...!" << endl;
		return indices;
	}
	tmpvec.resize(size);
	for(i = 0;i < size;i++) tmpvec[i] = i;
	do
	{
		// join the words to line
		line.clear();
		for(i = 0;i < size;i++)
		{
			int index = tmpvec[i];
			line += words[index];
		}
		// find line in the s
		{
		int pos = s.find(line, 0);
		if(pos == string::npos) continue;
		int len = line.size();
		do
		{
			indices.push_back(pos);
			pos = s.find(line, pos + len);
		}while(pos != string::npos);
		}
	}while(next_permutation(tmpvec.begin(), tmpvec.end()));

	return indices;
	
}
int main() 
{
	string s = "barfoofoobarthefoobarman";
	vector<string>words;
	words.push_back("bar");
	words.push_back("foo");
	words.push_back("the");
	vector<int>&rs = findSubstring(s, words);
	copy(rs.begin(), rs.end(), ostream_iterator<int>(cout, " "));
	cout << endl;

	return 0;
}

CC=g++
all:
	$(CC) -std=c++11 -g -o hello helloC++.cpp -pthread -lpthread