package com.fishercoder.solutions;

/**
 * 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.
 * 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.

 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].
 */
public class _734 {
    public static class Solution1 {
        public boolean areSentencesSimilar(String[] words1, String[] words2, String[][] pairs) {
            if (words1.length != words2.length) {
                return false;
            }
            for (int i = 0; i < words1.length; i++) {
                if (!isSimilar(words1[i], words2[i], pairs)) {
                    return false;
                }
            }
            return true;
        }

        private boolean isSimilar(String word1, String word2, String[][] pairs) {
            if (word1.equals(word2)) {
                return true;
            }
            for (int i = 0; i < pairs.length; i++) {
                String[] pair = pairs[i];
                if (pair[0].equals(word1) && pair[1].equals(word2)) {
                    return true;
                }
                if (pair[0].equals(word2) && pair[1].equals(word1)) {
                    return true;
                }
            }
            return false;
        }
    }
}

@@ -33,985 +33,8 @@
 s;%0A%0A
-/**%0A * 734. Sentence Similarity%0A *%0A * 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.%0A * For example, %22great acting skills%22 and %22fine drama talent%22 are similar, if the similar word pairs are pairs = %5B%5B%22great%22, %22fine%22%5D, %5B%22acting%22,%22drama%22%5D, %5B%22skills%22,%22talent%22%5D%5D.%0A * Note that the similarity relation is not transitive. For example, if %22great%22 and %22fine%22 are similar, and %22fine%22 and %22good%22 are similar, %22great%22 and %22good%22 are not necessarily similar.%0A * Also, a word is always similar with itself. For example, the sentences words1 = %5B%22great%22%5D, words2 = %5B%22great%22%5D, pairs = %5B%5D are similar, even though there are no specified similar word pairs.%0A%0A Note:%0A%0A The length of words1 and words2 will not exceed 1000.%0A The length of pairs will not exceed 2000.%0A The length of each pairs%5Bi%5D will be 2.%0A The length of each words%5Bi%5D and pairs%5Bi%5D%5Bj%5D will be in the range %5B1, 20%5D.%0A */%0A
 publ

refactor 734