LeetCode From Easy To Hard No3[Easy]: Find Anagram Mappings 异构映射

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

A, B 两个list元素是一样的，只是元素所在的索引位置不一样，现在就是想输出list A 中元素在listB 中下标。

如果没做之前两个LeetCode，我二话不说就想到用双重for循环

class Solution {
    public Vector<Integer> anagramMappings(Vector<Integer> A, Vector<Integer> B) {

        Vector<Integer> result = new Vector<Integer>();

        for (int i = 0; i < A.size(); i++) {
            for (int j = 0; j < B.size(); j++) {
                if (A.get(i) == B.get(j)) {
                    result.add(j);
                    break;
                }
            }
        }
        return result;
        
    }
    public static void main(String[] args) {
        Vector<Integer> A =  new Vector<Integer>(Arrays.asList(12, 28, 46, 32, 50));
        Vector<Integer> B =  new Vector<Integer>(Arrays.asList(50, 12, 32, 46, 28));
        System.out.println(new Solution().anagramMappings(A, B));
    }
}

 

有了之前的练习，知道双重for循环的时间复杂度是O(MN), 所以还是利用Map先将B的下标和值存起来，再遍历A，在Map中查找每个数字的位置即可。两个循环分开，复杂度就变成O(M+N)，得到优化：

class Solution {
    public Vector<Integer> anagramMappings(Vector<Integer> A, Vector<Integer> B) {

        Vector<Integer> result = new Vector<Integer>();
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < B.size(); i++) {
            map.put(B.get(i), i);
        }
        for (int i = 0; i < A.size(); i++) {
            result.add(map.get(A.get(i)));
        }
        return result;
        
    }
    public static void main(String[] args) {
        Vector<Integer> A =  new Vector<Integer>(Arrays.asList(12, 28, 46, 32, 50));
        Vector<Integer> B =  new Vector<Integer>(Arrays.asList(50, 12, 32, 46, 28));
        System.out.println(new Solution().anagramMappings(A, B));
    }
}