LeetCode in Kotlin

1899. Merge Triplets to Form Target Triplet

Medium

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):

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

Example 1:

Input: triplets = [[2,5,3],[1,8,4],[1,7,5]], target = [2,7,5]

Output: true

Explanation: Perform the following operations:

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

Example 2:

Input: triplets = [[3,4,5],[4,5,6]], target = [3,2,5]

Output: false

Explanation: It is impossible to have [3,2,5] as an element because there is no 2 in any of the triplets.

Example 3:

Input: triplets = [[2,5,3],[2,3,4],[1,2,5],[5,2,3]], target = [5,5,5]

Output: true

Explanation: Perform the following operations:

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

Constraints:

Solution

class Solution {
    fun mergeTriplets(triplets: Array<IntArray>, target: IntArray): Boolean {
        var one = false
        var two = false
        var three = false
        for (triplet in triplets) {
            if (!one && triplet[0] == target[0] && triplet[1] <= target[1] && triplet[2] <= target[2]) {
                one = true
            }
            if (!two && triplet[0] <= target[0] && triplet[1] == target[1] && triplet[2] <= target[2]) {
                two = true
            }
            if (!three && triplet[0] <= target[0] && triplet[1] <= target[1] && triplet[2] == target[2]) {
                three = true
            }
            if (one && two && three) {
                return true
            }
        }
        return false
    }
}