Package g1801_1900.s1899_merge_triplets_to_form_target_triplet

Class Solution

java.lang.Object
g1801_1900.s1899_merge_triplets_to_form_target_triplet.Solution
public class Solution extends Object
1899 - Merge Triplets to Form Target Triplet.<p>Medium</p> <p>A <strong>triplet</strong> is an array of three integers. You are given a 2D integer array <code>triplets</code>, where <code>triplets[i] = [a<sub>i</sub>, b<sub>i</sub>, c<sub>i</sub>]</code> describes the <code>i<sup>th</sup></code> <strong>triplet</strong>. You are also given an integer array <code>target = [x, y, z]</code> that describes the <strong>triplet</strong> you want to obtain.</p> <p>To obtain <code>target</code>, you may apply the following operation on <code>triplets</code> <strong>any number</strong> of times (possibly <strong>zero</strong> ):</p> <ul> <li>Choose two indices ( <strong>0-indexed</strong> ) <code>i</code> and <code>j</code> (<code>i != j</code>) and <strong>update</strong> <code>triplets[j]</code> to become <code>[max(a<sub>i</sub>, a<sub>j</sub>), max(b<sub>i</sub>, b<sub>j</sub>), max(c<sub>i</sub>, c<sub>j</sub>)]</code>. <ul> <li>For example, if <code>triplets[i] = [2, 5, 3]</code> and <code>triplets[j] = [1, 7, 5]</code>, <code>triplets[j]</code> will be updated to <code>[max(2, 1), max(5, 7), max(3, 5)] = [2, 7, 5]</code>.</li> </ul> </li> </ul> <p>Return <code>true</code> <em>if it is possible to obtain the</em> <code>target</code> <em><strong>triplet</strong></em> <code>[x, y, z]</code> <em>as an <strong>element</strong> of</em> <code>triplets</code><em>, or</em> <code>false</code> <em>otherwise</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> triplets = [[2,5,3],[1,8,4],[1,7,5]], target = [2,7,5]</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> Perform the following operations:</p> <ul> <li>Choose the first and last triplets [[2,5,3],[1,8,4],[1,7,5]]. Update the last triplet to be [max(2,1), max(5,7), max(3,5)] = [2,7,5]. triplets = [[2,5,3],[1,8,4],[2,7,5]]</li> </ul> <p>The target triplet [2,7,5] is now an element of triplets.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> triplets = [[3,4,5],[4,5,6]], target = [3,2,5]</p> <p><strong>Output:</strong> false</p> <p><strong>Explanation:</strong> It is impossible to have [3,2,5] as an element because there is no 2 in any of the triplets.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> triplets = [[2,5,3],[2,3,4],[1,2,5],[5,2,3]], target = [5,5,5]</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> Perform the following operations:</p> <ul> <li> <p>Choose the first and third triplets [[2,5,3],[2,3,4],[1,2,5],[5,2,3]]. Update the third triplet to be [max(2,1), max(5,2), max(3,5)] = [2,5,5]. triplets = [[2,5,3],[2,3,4],[2,5,5],[5,2,3]].</p> </li> <li> <p>Choose the third and fourth triplets [[2,5,3],[2,3,4],[2,5,5],[5,2,3]]. Update the fourth triplet to be [max(2,5), max(5,2), max(5,3)] = [5,5,5]. triplets = [[2,5,3],[2,3,4],[2,5,5],[5,5,5]].</p> </li> </ul> <p>The target triplet [5,5,5] is now an element of triplets.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= triplets.length <= 10<sup>5</sup></code></li> <li><code>triplets[i].length == target.length == 3</code></li> <li><code>1 <= a<sub>i</sub>, b<sub>i</sub>, c<sub>i</sub>, x, y, z <= 1000</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • mergeTriplets

      public boolean mergeTriplets(int[][] triplets, int[] target)