Leetcode/src/main/java/com/fishercoder/solutions/secondthousand/_1899.java at master · fishercoder1534/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package com.fishercoder.solutions.secondthousand;

public class _1899 {
    public static class Solution1 {
        public boolean mergeTriplets(int[][] triplets, int[] target) {
            int[] base = new int[3];
            int baseIndex = -1;
            for (int i = 0; i < triplets.length; i++) {
                if (findBaseTriplet(triplets[i], target)) {
                    base = triplets[i];
                    baseIndex = i;
                    break;
                }
            }
            for (int i = 0; i < triplets.length; i++) {
                if (i != baseIndex) {
                    boolean merged = false;
                    if (shouldMerge(triplets[i], target, 0)) {
                        merged = true;
                        base = mergeTriplets(triplets[i], base);
                    }
                    if (!merged && shouldMerge(triplets[i], target, 1)) {
                        merged = true;
                        base = mergeTriplets(triplets[i], base);
                    }
                    if (!merged && shouldMerge(triplets[i], target, 2)) {
                        base = mergeTriplets(triplets[i], base);
                    }
                }
            }
            return base[0] == target[0] && base[1] == target[1] && base[2] == target[2];
        }

        private int[] mergeTriplets(int[] triplet, int[] base) {
            return new int[] {
                Math.max(triplet[0], base[0]),
                Math.max(triplet[1], base[1]),
                Math.max(triplet[2], base[2])
            };
        }

        private boolean shouldMerge(int[] triplet, int[] target, int i) {
            if (triplet[i] == target[i]) {
                // check the other two indexes not exceeding target
                if (i == 0) {
                    return triplet[1] <= target[1] && triplet[2] <= target[2];
                } else if (i == 1) {
                    return triplet[0] <= target[0] && triplet[2] <= target[2];
                } else if (i == 2) {
                    return triplet[0] <= target[0] && triplet[1] <= target[1];
                }
            }
            return false;
        }

        private boolean findBaseTriplet(int[] triplet, int[] target) {
            if (triplet[0] <= target[0] && triplet[1] <= target[1] && triplet[2] <= target[2]) {
                return true;
            }
            return false;
        }
    }
}