Leetcode零基础学习-IDE环境(Find Anagram Mappings)

最新推荐文章于 2024-08-08 07:19:49 发布

Ace_ding

最新推荐文章于 2024-08-08 07:19:49 发布

阅读量398

点赞数

分类专栏： LeetCode 文章标签：初学者

本文链接：https://blog.csdn.net/Ace_ding/article/details/80983574

版权

LeetCode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Description

Given two lists A and B, and B is an anagram of A. B is an anagram of A means B is made by randomizing the order of the elemes

in A.We want to find an index mapping P, from A to B. A mapping P[i] = j means the i th element in A appears in B at index j.

These lists A and B may contain duplicates. If there are multiple answers, output any of them.

For example, given

A = [12, 28, 46, 32, 50]

B = [50, 12, 32, 46, 28]

We should return (即返还的列表P中的元素为A中第0,1,2,3...个元素在B中的序号)

[1, 4, 3, 2, 0]

as P[0] = 1 because the 0 th element of A appearsat B[1], and P[1] = 4 because the 1st element of A appearsat B[4], and so on.

Note:

1. A, B have equal lengths inrange [1, 100].

2. A[i], B[i] are integers in range [0, 10^5].

Solution

#include<iostream>
#include<string>
#include<vector>
using namespace std;

class Solution {
public:
	vector <int> anagramMappings(vector<int> &A, vector <int>& B) {
		vector<int> result;
		int counter = 0;
		for(int i=0;i<A.size();i++)
			for (int j = 0; j < B.size(); j++)
			{
				if (B[j] == A[i]) {
					result.push_back(j);
					break;
				}
			}
		return result;
	}
};


int main()
{
	cout << "anagramMappings:\n";
	Solution anagram;
	vector <int> X = { 12,28,46,32,50 };
	vector <int> Y = { 50,12,32,46,28 };
	vector <int> anagram_result;
	anagram_result = anagram.anagramMappings(X, Y);
	cout << "result= "<<endl;
		for (int k = 0; k < anagram_result.size(); k++)
			cout << anagram_result[k] << " ";
	system("pause");
	return 0;

}