-
Notifications
You must be signed in to change notification settings - Fork 0
/
sentence_similarity-iii.java
24 lines (23 loc) · 1.19 KB
/
sentence_similarity-iii.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
//Q. - You are given two strings sentence1 and sentence2, each representing a sentence composed of words. A sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each word consists of only uppercase and lowercase English characters.
// Two sentences s1 and s2 are considered similar if it is possible to insert an arbitrary sentence (possibly empty) inside one of these sentences such that the two sentences become equal. Note that the inserted sentence must be separated from existing words by spaces
//Solution -
class Solution {
public boolean areSentencesSimilar(String sentence1, String sentence2) {
String[] s1 = sentence1.split(" ");
String[] s2 = sentence2.split(" ");
int i = 0, j = 0;
while (i < s1.length && j < s2.length){
if (!s1[i].equals(s2[j])) break;
i++;
j++;
}
if (i == s1.length || j == s2.length) return true;
int len1 = s1.length - 1, len2 = s2.length - 1;
while(len1 >= i && len2 >= j){
if(!s1[len1].equals(s2[len2])) return false;
len1--;
len2--;
}
return len1 < i || len2 < j;
}
}