5],[5,5,5]]. The target triplet [5,5,5] is now an element of triplets.

Solution

Method 1 – Greedy Filtering and Merging

Intuition

The key idea is to only consider triplets where each value does not exceed the corresponding value in the target. By greedily merging these valid triplets, we can maximize each dimension and try to reach the target. If we can form the target triplet by combining these, the answer is true.

Approach

Initialize a result triplet ans as [0, 0, 0].
Iterate through each triplet in the input:
- If all elements of the triplet are less than or equal to the corresponding elements in the target, consider it valid.
- For each valid triplet, update ans by taking the maximum of each coordinate with the current triplet.
After processing all triplets, check if ans matches the target triplet.
Return true if they match, false otherwise.

Code

[{"language":"C++","code":"class Solution {\npublic:\n     bool mergeTriplets(vector<vector<int>>& triplets, vector<int>& t) {\n          vector<int> ans(3, 0);\n          for (auto& s : triplets) {\n                if (s[0] <

Related Tags