merge-triplets-to-form-target-triplet.cpp

// Time:  O(n)
// Space: O(1)

class Solution {
public:
    bool mergeTriplets(vector<vector<int>>& triplets, vector<int>& target) {
        vector<int> result(3);
        for (const auto& t : triplets) {
            if (t[0] <= target[0] && t[1] <= target[1] && t[2] <= target[2]) {
                result = {max(result[0], t[0]), max(result[1], t[1]), max(result[2], t[2])};
            }
        }
        return result == target;
    }
};