游戏中弱角色的数量

import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;

class Solution {
    public static void main(String[] args) {
        Object res = new Solution().numberOfWeakCharacters(new int[][]{
                {1, 5}, {1, 4}, {4, 3}
        });
        System.out.println(res);
    }

    public int numberOfWeakCharacters(int[][] properties) {
        Arrays.sort(properties, (o1, o2) -> o1[0] == o2[0] ? (o1[1] - o2[1]) : (o2[0] - o1[0]));
        int maxDef = 0;
        int ans = 0;
        for (int[] p : properties) {
            if (p[1] < maxDef) {
                ans++;
            } else {
                maxDef = p[1];
            }
        }
        return ans;
    }


    @Deprecated
    public int numberOfWeakCharacters_Deprecated(int[][] properties) {
        HashSet<int[]> weaker = new HashSet<>();
        for (int i = 0; i < properties.length - 1; i++) {
            for (int j = i + 1; j < properties.length; j++) {
                if (properties[i][0] > properties[j][0] && properties[i][1] > properties[j][1]) {
                    weaker.add(properties[j]);
                } else {
                    if (properties[i][0] < properties[j][0] && properties[i][1] < properties[j][1]) {
                        weaker.add(properties[i]);
                    }
                }
            }
        }
        return weaker.size();
    }
}