【LeetCode】760. Find Anagram Mappings

Python版本：Python3.6.2

760. Find Anagram Mappings

Given two lists Aand 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 A appears at B[4], and so on.
Note:
A, B have equal lengths in range [1, 100].
A[i], B[i] are integers in range [0, 10^5].

自己的代码：

class Solution:
    def anagramMappings(self, A, B):
        """
        :type A: List[int]
        :type B: List[int]
        :rtype: List[int]
        """
        res = []
        for i in range(len(A)):
            for j in range(len(B)):
                if A[i] == B[j]:
                    res.append(j)
                    break
        return res

用给出的例子检验下：

x = Solution()
A1 = [12, 28, 46, 32, 50]
B1 = [50, 12, 32, 46, 28]
print(x.anagramMappings(A=A1, B=B1))

编译成功！Accepted!

痛点：

再创建了空数组后，要在末尾新增元素怎么办？

正解：append()

要加什么在括号了写什么。

由于是新出来的题目，看编号760，所以还没有大神的答案，不过有官方给出的方法，先贴代码：

class Solution(object):
    def anagramMappings(self, A, B):
        D = {x: i for i, x in enumerate(B)}
        return [D[x] for x in A]

如此的简洁优美！

这里是用到了Hash table，比较像字典，包含键值对。以及函数enumerate()——返回数组的索引和值。

• Hash table，比较像字典，包含键值对，例如：D={46: 0, 12: 1, 28: 2}
  
• enumerate()——返回数组的序号和对应的值