LeetCode 737. Sentence Similarity II

ID	Title	Difficulty
1	Two Sum	Easy
2	Add Two Numbers	Medium
3	Longest Substring Without Repeating Characters	Medium
4	Median of Two Sorted Arrays	Hard
5	Longest Palindromic Substring	Medium
6	Zigzag Conversion	Medium
7	Reverse Integer	Medium
8	String to Integer (atoi)	Medium
9	Palindrome Number	Easy
10	Regular Expression Matching	Hard
11	Container With Most Water	Medium
12	Integer to Roman	Medium
13	Roman to Integer	Easy
14	Longest Common Prefix	Easy
15	3Sum	Medium
16	3Sum Closest	Medium
17	Letter Combinations of a Phone Number	Medium
18	4Sum	Medium
19	Remove Nth Node From End of List	Medium
20	Valid Parentheses	Easy
21	Merge Two Sorted Lists	Easy
22	Generate Parentheses	Medium
23	Merge k Sorted Lists	Hard
24	Swap Nodes in Pairs	Medium
25	Reverse Nodes in k-Group	Hard
26	Remove Duplicates from Sorted Array	Easy
27	Remove Element	Easy
28	Find the Index of the First Occurrence in a String	Easy
29	Divide Two Integers	Medium
30	Substring with Concatenation of All Words	Hard
31	Next Permutation	Medium
32	Longest Valid Parentheses	Hard
33	Search in Rotated Sorted Array	Medium
34	Find First and Last Position of Element in Sorted Array	Medium
35	Search Insert Position	Easy
36	Valid Sudoku	Medium
37	Sudoku Solver	Hard
38	Count and Say	Medium
39	Combination Sum	Medium
40	Combination Sum II	Medium
41	First Missing Positive	Hard
42	Trapping Rain Water	Hard
43	Multiply Strings	Medium
44	Wildcard Matching	Hard
45	Jump Game II	Medium
46	Permutations	Medium
47	Permutations II	Medium
48	Rotate Image	Medium
49	Group Anagrams	Medium
50	Pow(x, n)	Medium

JIAKAOBO

LeetCode

感谢赞助!

㊗️
大家
offer
多多！

Problem

We can represent a sentence as an array of words, for example, the sentence “I am happy with leetcode” can be represented as arr = [“I”,”am”,happy”,”with”,”leetcode”].

Given two sentences sentence1 and sentence2 each represented as a string array and given an array of string pairs similarPairs where $s i m i l a r P a i r s [i] = [x_{i}, y_{i}]$ indicates that the two words $x_{i}$ and $y_{i}$ are similar.

Return true if sentence1 and sentence2 are similar, or false if they are not similar.

Two sentences are similar if:

They have the same length (i.e., the same number of words) sentence1[i] and sentence2[i] are similar. Notice that a word is always similar to itself, also notice that the similarity relation is transitive. For example, if the words a and b are similar, and the words b and c are similar, then a and c are similar.

Example 1:

Input: sentence1 = ["great","acting","skills"], sentence2 = ["fine","drama","talent"], similarPairs = [["great","good"],["fine","good"],["drama","acting"],["skills","talent"]]
Output: true
Explanation: The two sentences have the same length and each word i of sentence1 is also similar to the corresponding word in sentence2.

Example 2:

Input: sentence1 = ["I","love","leetcode"], sentence2 = ["I","love","onepiece"], similarPairs = [["manga","onepiece"],["platform","anime"],["leetcode","platform"],["anime","manga"]]
Output: true
Explanation: "leetcode" --> "platform" --> "anime" --> "manga" --> "onepiece".
Since "leetcode is similar to "onepiece" and the first two words are the same, the two sentences are similar.

Example 3:

Input: sentence1 = ["I","love","leetcode"], sentence2 = ["I","love","onepiece"], similarPairs = [["manga","hunterXhunter"],["platform","anime"],["leetcode","platform"],["anime","manga"]]
Output: false
Explanation: "leetcode" is not similar to "onepiece".

Constraints:

1 <= sentence1.length, sentence2.length <= 1000
1 <= sentence1[i].length, sentence2[i].length <= 20
sentence1[i] and sentence2[i] consist of lower-case and upper-case English letters.
0 <= similarPairs.length <= 2000
similarPairs[i].length == 2
$1 <= x_{i} . l e n g t h, y_{i} . l e n g t h <= 20$
$x_{i}$ and $y_{i}$ consist of English letters.