Merge Triplets to Form Target Triplet LeetCode solution in Java

1
class Solution {
2
public boolean mergeTriplets(int[][] triplets, int[] target) {
3

4
boolean xFound = false, yFound = false, zFound = false;
5

6
for (int[] triplet : triplets) {
7

8
// Current Triplet is target
9
if (triplet[0] == target[0] && triplet[1] == target[1] && triplet[2] == target[2])
10
return true;
11

12
if (triplet[0] == target[0]) {
13
if (triplet[1] <= target[1] && triplet[2] <= target[2])
14
if (yFound && zFound) return true;
15
else xFound = true;
16
}
17
if (triplet[1] == target[1]) {
18
if (triplet[0] <= target[0] && triplet[2] <= target[2])
19
if (xFound && zFound) return true;
20
else yFound = true;
21
}
22
if (triplet[2] == target[2]) {
23
if (triplet[1] <= target[1] && triplet[0] <= target[0])
24
if (yFound && xFound) return true;
25
else zFound = true;
26
}
27
}
28
return xFound && yFound && zFound;
29
}
30
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0