zoukankan      html  css  js  c++  java
  • 760. Find Anagram Mappings

    Given two lists Aand B, and B is an anagram of AB 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:

    1. A, B have equal lengths in range [1, 100].
    2. A[i], B[i] are integers in range [0, 10^5].

    找出A中的每个元素对应B中的哪个位置

    C++(9ms):

     1 class Solution {
     2 public:
     3     vector<int> anagramMappings(vector<int>& A, vector<int>& B) {
     4         unordered_map<int,int> m ;
     5         vector<int> res ;
     6         for(int i = 0 ; i < B.size() ; i++){
     7             m[B[i]] = i ;
     8         }
     9         for(int i : A){
    10             res.push_back(m[i]) ;
    11         }
    12         return res; 
    13     }
    14 };
  • 相关阅读:
    JAVA SE 基础复习-虚拟机
    不错的博客
    如何分析问题
    由Contains开始的
    相关有用链接
    C++语法一二
    关于论文的些许想法
    C++中一些容易迷惑的语法点总结
    android中各种组件的生命周期问题
    android开源框架thinkinandroid相关研究
  • 原文地址:https://www.cnblogs.com/mengchunchen/p/8258906.html
Copyright © 2011-2022 走看看