跳转到内容

Sparse Arrays 稀疏阵列

发布于:

Sparse Arrays | HackerRank

有一个输入字符串集合和一个查询字符串集合。对于每个查询字符串,确定它在输入字符串列表中出现的次数。返回结果数组。

Example

strings = [‘ab’,‘ab’,‘abc’]

queries = [‘ab’,‘abc’,‘bc]

对于query,在返回数组result= [2,1,0]

function matchingStrings(strings: string[], queries: string[]): number[] {
  // Write your code here
  let res: number[] = [];
  for (let query of queries) {
    let count = 0;
    for (let item of strings) {
      if (item === query) {
        count++;
      }
    }
    res.push(count);
  }
  return res;
}