問題:數組
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
.app
We want to find an index mapping P
, from A
to B
. A mapping P[i] = j
means the i
th element in A
appears in B
at index j
.dom
These lists A
and B
may contain duplicates. If there are multiple answers, output any of them.code
For example, givenip
A = [12, 28, 46, 32, 50] B = [50, 12, 32, 46, 28]
We should returnelement
[1, 4, 3, 2, 0]
as P[0] = 1
because the 0
th element of A
appears at B[1]
, and P[1] = 4
because the 1
st element of A
appears at B[4]
, and so on.get
Note:hash
A, B
have equal lengths in range [1, 100]
.A[i], B[i]
are integers in range [0, 10^5]
.解決:io
【題意】給兩個數組,數組A和數組B中有相同的數字,把數組A中每一個數字在數組B中對應位置的下標輸出。class
① 使用hashmap。
class Solution { //6ms public int[] anagramMappings(int[] A, int[] B) { int[] res = new int[A.length]; Map<Integer,Integer> map = new HashMap<>(); for (int i = 0;i < B.length;i ++){ map.put(B[i],i); } for (int i = 0;i < A.length;i ++){ if (map.containsKey(A[i])){ int index = map.get(A[i]); res[i] = index; } } return res; } }