zoukankan      html  css  js  c++  java
  • 734. Sentence Similarity 句子相似性

    Given two sentences words1, words2 (each represented as an array of strings), and a list of similar word pairs pairs, determine if two sentences are similar.

    For example, "great acting skills" and "fine drama talent" are similar, if the similar word pairs are pairs = [["great", "fine"], ["acting","drama"], ["skills","talent"]].

    Note that the similarity relation is not transitive. For example, if "great" and "fine" are similar, and "fine" and "good" are similar, "great" and "good" are not necessarily similar.

    However, similarity is symmetric. For example, "great" and "fine" being similar is the same as "fine" and "great" being similar.

    Also, a word is always similar with itself. For example, the sentences words1 = ["great"], words2 = ["great"], pairs = [] are similar, even though there are no specified similar word pairs.

    Finally, sentences can only be similar if they have the same number of words. So a sentence like words1 = ["great"] can never be similar to words2 = ["doubleplus","good"].

    Note:

  • The length of words1 and words2 will not exceed 1000.
  • The length of pairs will not exceed 2000.
  • The length of each pairs[i] will be 2.
  • The length of each words[i] and pairs[i][j] will be in the range [1, 20].


  1. public class Solution {
  2. public bool AreSentencesSimilar(string[] words1, string[] words2, string[,] pairs)
  3. {
  4. if (words1.Length != words2.Length)
  5. return false;
  6. HashSet<string> set = new HashSet<string>();
  7. for (int i = 0; i < pairs.GetLength(0); i++)
  8. set.Add($"{pairs[i, 0]}:{pairs[i, 1]}");
  9. for (int i = 0; i < words1.Length; i++)
  10. {
  11. if (words1[i] == words2[i])
  12. continue;
  13. if (!set.Contains($"{words1[i]}:{words2[i]}") && !set.Contains($"{words2[i]}:{words1[i]}"))
  14. return false;
  15. }
  16. return true;
  17. }
  18. }




来自为知笔记(Wiz)


查看全文
  • 相关阅读:
    使用匿名内部类和lamda的方式创建线程
    匿名内部类与lamda表达式
    机器学习中数据量多少与模型过拟合欠拟合之间的关系
    设计模式和java实现
    八大排序算法汇总——java实现
    java多线程并发编程中的锁
    java NIO
    网络通信引擎ICE的使用
    机器学习算法汇总大梳理
    处理样本不均衡数据
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/7912964.html
  • Copyright © 2011-2022 走看看