problems(java): add “1160. Find Words That Can Be Formed by Characters”

Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2023-12-02 21:17:10 +01:00
parent 04eb72383c
commit 554628a284
Signed by: mfocko
GPG key ID: 7C47D46246790496

View file

@ -0,0 +1,27 @@
class Solution {
public boolean arrayStringsAreEqual(String[] word1, String[] word2) {
int i = 0, ii = 0;
int j = 0, jj = 0;
while (i < word1.length && j < word2.length) {
if (word1[i].charAt(ii) != word2[j].charAt(jj)) {
return false;
}
++ii;
++jj;
if (ii >= word1[i].length()) {
++i;
ii = 0;
}
if (jj >= word2[j].length()) {
++j;
jj = 0;
}
}
return i == word1.length && j == word2.length && ii == 0 && jj == 0;
}
}