#793 · #1899 · Merge Triplets to Form Target Triplet(合并若干三元组以形成目标三元组)

You are given a 2D array triplets and an integer array target. In one operation pick two triplets and replace them with their element-wise maximum. Return true if you can obtain target. Constraints: 1 <= triplets.length <= 10^5, triplets[i].length == 3, 1 <= triplets[i][j], target[j] <= 1000.