LeetCode 760 Find Anagram Mappings 查找字谜映射

Giventwo lists Aand B, and B is
 an anagram of A. B is an anagram of A means B is
 made by randomizing theorder of the elements in A.
Wewant to find an index mapping P, from A to B.
 A mapping P[i] = j means the ith element in A appears
 in B at index j.
Theselists A and B may contain duplicates. Ifthere are multiple answers, output any of
 them.
Forexample, given

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

We should return

[1, 4, 3, 2, 0]

as P[0] = 1 because the 0th 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].

 

 

int numJewelsInStones(string J, string S) {
        class Solution {
            public:    
            vector<int> anagramMappings(vector<int>& A, vector<int>& B) {
                vector<int> result;
                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;
            }};

原文：https://blog.csdn.net/u012737193/article/details/79001212