京东2019校招算法岗笔试题

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/grllery/article/details/82594083

 

#include <iostream>
#include <vector>
#include <numeric>
#include <limits>
#include <string>
#include <map>

using namespace std;

//判断map中不同的key是否有相同的value
bool ValueIsSame(map<char, char> similar)
{
	for (map<char, char>::iterator iter = similar.begin(); iter != similar.end(); iter++)
	{
		for (map<char, char>::iterator iter2 = similar.begin(); iter2 != similar.end(); iter2++)
		{
			if (iter->first != iter2->first && iter->second == iter2->second)
			{
				return false;
			}
		}
	}
	return true;
}

int solve(string s, string t)
{
	int number = 0;
	size_t subLen = t.size();
	for (size_t i = 0; i < s.size() - subLen +1; i++)
	{
		map<char, char> similar;
		string subStr = s.substr(i, subLen);
		for (size_t j = 0; j < subLen; j++)
		{
			auto iter = similar.find(subStr[j]);
			if (iter == similar.end())
			{
				similar[subStr[j]] = t[j];
			}
			else
			{
				char mp = iter->second;
				if (mp != t[j])
				{
					cout << "不满足条件！" << endl;
					break;
				}
			}
			if (j == subLen -1 && ValueIsSame(similar))
			{
				number++;
				cout << subStr << endl;
			}
		}
	}
	return number;
}

int main()
{
	int res;

	string _S;
	getline(cin, _S);
	string _T;
	getline(cin, _T);
	
	res = solve(_S, _T);
	cout << res << endl;
	return 0;
}