2020年9月第1周 - 智云健康前端技术每周文摘（含谷歌面试题）编辑距离是一种量化两个字符串差异的方法，其含义是：将一

原创

神秘的JS字符串隐写术：利用Unicode隐藏字符加密你的可见字符

文章与新闻

每周一练

谷歌面试题

编辑距离是一种量化两个字符串差异的方法，其含义是：将一个字符串转换为另一个字符串的最小转换次数来计算的。转换包括插入、删除和替换。

比如 cat 与 cat，编辑距离为0。

举个例子：

getEditDistance('mitten', 'sitting'); // 3

原理：

1. mitten -> sitten （用's'替换'm'）
2. sitten -> sittin （用'i'替换'e'）
3. sittin -> sitting （在末尾插入'g'）

你能写一个getEditDistance(a, b)方法来返回编辑距离吗？

// Available Data Structures
class Graph {
  constructor() {
    this.adjacencyList = new Map();
    this.verticesCount = 0;
  }

  addVertex(nodeVal) {
    this.adjacencyList.set(nodeVal, []);
    this.verticesCount++;
  }

  addEdge(src, dest) {
    this.adjacencyList.get(src).push(dest);
    this.adjacencyList.get(dest).push(src);
  }

  removeVertex(val) {
    if (this.adjacencyList.get(val)) {
      this.adjacencyList.delete(val);
    }
    
    this.adjacencyList.forEach((vertex) => {
      const neighborIdx = vertex.indexOf(val);
      if (neighborIdx >= 0) {
        vertex.splice(neighborIdx, 1);
      }
    })
  }

  removeEdge(src, dest) {
    const srcDestIdx = this.adjacencyList.get(src).indexOf(dest);
    this.adjacencyList.get(src).splice(srcDestIdx, 1);
  
    const destSrcIdx = this.adjacencyList.get(dest).indexOf(src);
    this.adjacencyList.get(dest).splice(destSrcIdx, 1);
  }

  printNeighbors() {
    const result = [];
    
    for (let vertex of this.adjacencyList.keys()) {
      const neighbors = [];
      neighbors.push(`${vertex}:`);
      this.adjacencyList.get(vertex).forEach((neighbor) => {
        neighbors.push(neighbor);
      });
      result.push(neighbors.join(" "));
    }

    return result;
  }

  verticesCount() {
    return this.verticesCount;
  }

  reverse() {
    const graph = new Graph();
    for (let [src, dests] of this.adjacencyList) {
      graph.addVertex(src);
    }

    for(let [src, dests] of this.adjacencyList) {
      for (let dest of this.adjacencyList.get(src)) {
        graph.adjacencyList.get(src).push(dest);
      }
    }

    return graph;
  }
}

var matrix1 = [
  [1, 1, 0, 0, 0],
  [0, 1, 1, 0, 0],
  [0, 1, 0, 1, 0],
  [1, 0, 0, 0, 0]
];

var matrix2 = [
  [1, 1, 0, 0],
  [0, 0, 1, 0],
  [0, 1, 1, 0],
  [1, 0, 0, 0]
];

var planeMatrix1 = [
  [".", ".", ".", "P"],
  [".", ".", ".", "P"],
  ["P", "P", ".", "P"],
  [".", ".", ".", "P"],
];

2020年9月第1周 - 智云健康前端技术每周文摘（含谷歌面试题）

原创

文章与新闻

推荐库

每周一练

谷歌面试题