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 elements in A.
We want 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.
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
[1, 4, 3, 2, 0]
as P[0] = 1 because the 0th element of A appears at B[1], and P[1] = 4 because the 1st element of Aappears at B[4], and so on.
Note:
A, Bhave equal lengths in range[1, 100].A[i], B[i]are integers in range[0, 10^5].
這道題給了我們兩個數組A和B，說是A和B中的數字都相同，但是順序不同，有點類似錯位詞的感覺。讓我們找出數組A中的每個數字在數組B中的位置。這道題沒有太大的難度，用個HashMap建立數組B中的每個數字和其位置之間的映射，然后遍歷數組A，在HashMap中查找每個數字的位置即可，參見代碼如下：
class Solution { public: vector<int> anagramMappings(vector<int>& A, vector<int>& B) { vector<int> res; unordered_map<int, int> m; for (int i = 0; i < B.size(); ++i) m[B[i]] = i; for (int num : A) res.push_back(m[num]); return res; } };
類似題目：