1899. Merge Triplets to Form Target Triplet

A triplet is an array of three integers. You are given a 2D integer array triplets, where triplets[i] = [ai, bi, ci] describes the ith triplet. You are also given an integer array target = [x, y, z] that describes the triplet you want to obtain.

To obtain target, you may apply the following operation on triplets any number of times (possibly zero):

• Choose two indices (0-indexed) i and j (i != j) and update triplets[j] to become [max(ai, aj), max(bi, bj), max(ci, cj)].

• For example, if triplets[i] = [2, 5, 3] and triplets[j] = [1, 7, 5], triplets[j] will be updated to [max(2, 1), max(5, 7), max(3, 5)] = [2, 7, 5].

Return true if it is possible to obtain the target triplet [x, y, z] as an element of triplets, or false otherwise.

class Solution {
public:
    bool mergeTriplets(vector<vector<int>>& triplets, vector<int>& target) {
        int a = INT_MIN, b = INT_MIN, c = INT_MIN;
        for(auto& t : triplets) {
            int aa = t[0], bb = t[1], cc = t[2];
            if(aa > target[0] or bb > target[1] or cc > target[2]) continue;
            a = max(aa, a);
            b = max(bb, b);
            c = max(cc, c);
        }
        return target[0] == a and target[1] == b and target[2] == c;
    }
};