PAT（甲级）2020年冬季考试7-2 Subsequence in Substring (25分)

7-2Subsequence in Substring(25分)

A substring is a continuous part of a string. A subsequence is the part of a string that might be continuous or not but the order of the elements is maintained. For example, given the string atpaaabpabtt, pabt is a substring, while pat is a subsequence.

Now given a string S and a subsequence P, you are supposed to find the shortest substring of S that contains P. If such a solution is not unique, output the left most one.

Input Specification:

Each input file contains one test case which consists of two lines. The first line contains S and the second line P. S is non-empty and consists of no more than 10​^4​​ lower English letters. P is guaranteed to be a non-empty subsequence of S.

Output Specification:

For each case, print the shortest substring of S that contains P. If such a solution is not unique, output the left most one.

Sample Input:

atpaaabpabttpcat
pat

Sample Output:

pabt

暴力

#include<bits/stdc++.h>
using namespace std;
string ans;
int minlen = 10005;
int main() {
	string s1, s2;
	cin >> s1 >> s2;
	int len1 = s1.size(), len2 = s2.size();
	for (int i = 0; i < len1; i++) {
		if (s1[i] == s2[0]) {
			int t = 1, j = i + 1;
			for (; j < len1; j++) {
				if (s1[j] == s2[t]) t++;
				if (t == len2) break;
			}
			if (len2 == t) {
				if (j - i + 1 < minlen) {
					minlen = j - i + 1;
					ans = s1.substr(i, j - i + 1);
				} 
			}
		}
	}
	printf("%s", ans.c_str());
}