[LeetCode] Find Anagram Mappings - JS

最新推荐文章于 2021-08-20 05:59:15 发布

原创最新推荐文章于 2021-08-20 05:59:15 发布 · 242 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #js #LeetCode

数据结构和算法同时被 2 个专栏收录

4 篇文章

订阅专栏

JavaScript

3 篇文章

订阅专栏

本文介绍了一种算法，用于解决两个包含重复元素的等长整数列表间的元素映射问题。给定列表A和B，其中B是A的乱序版本，我们需要找到一个映射P，使得A中的每个元素能与B中对应位置的元素相匹配。

描述

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].

源码

/**
 * @param {number[]} A
 * @param {number[]} B
 * @return {number[]}
 */
var anagramMappings = function(A, B) {
    var result = [];
    A.forEach((elm, i) => {
      result.push(B.indexOf(elm));
    });
    return result;
};