1395. 统计作战单位数

https://leetcode-cn.com/problems/count-number-of-teams/

 

中文题目：

 n 名士兵站成一排。每个士兵都有一个 独一无二 的评分 rating 。

每 3 个士兵可以组成一个作战单位，分组规则如下：

从队伍中选出下标分别为 i、j、k 的 3 名士兵，他们的评分分别为 rating[i]、rating[j]、rating[k]
作战单位需满足： rating[i] < rating[j] < rating[k] 或者 rating[i] > rating[j] > rating[k] ，其中  0 <= i < j < k < n
请你返回按上述条件可以组建的作战单位数量。每个士兵都可以是多个作战单位的一部分。

 

 

英文题目：

There are n soldiers standing in a line. Each soldier is assigned a unique rating value.

You have to form a team of 3 soldiers amongst them under the following rules:

Choose 3 soldiers with index (i, j, k) with rating (rating[i], rating[j], rating[k]).
A team is valid if:  (rating[i] < rating[j] < rating[k]) or (rating[i] > rating[j] > rating[k]) where (0 <= i < j < k < n).
Return the number of teams you can form given the conditions. (soldiers can be part of multiple teams).

 

 

示例 1：

输入：rating = [2,5,3,4,1]
输出：3
解释：我们可以组建三个作战单位 (2,3,4)、(5,4,1)、(5,3,1) 。
示例 2：

输入：rating = [2,1,3]
输出：0
解释：根据题目条件，我们无法组建作战单位。
示例 3：

输入：rating = [1,2,3,4]
输出：4
 

提示：

n == rating.length
1 <= n <= 200
1 <= rating[i] <= 10^5

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/count-number-of-teams
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

 

思路：

In a position, we need to record the number of soldiers that rating less than own rating and more than own rating. in for circulation, we lock a position and look back to find out the less. if rating[i] > rating[j], we record a soldier in the array and produce a serial rating[i] > rating[j] > rating[k] which number is minToMax[j]. Similarly, we can also record the number of more than own value.

 

 

题解：

class Solution {
    public int numTeams(int[] rating) {
        int len = rating.length;
        if (len <= 2) {
            return 0;
        }
        
        // 比当前士兵能力值高的人数
        int[] maxToMin = new int[len];
        int[] minToMax = new int[len];
        int result = 0;
        
        for (int i = 0; i < len; ++i) {
            maxToMin[i] = 0;
            minToMax[i] = 0;
            for (int j = i - 1; j >= 0; --j) {
                if (rating[i] > rating[j]) {
                    // 记录下一个比i能力值小的人
                    ++minToMax[i];
                    // rating[i]>rating[j] 
                    // rating[j] 比 minToMax[j]个人大
                    // 于是在当前位置有rating[i] > rating[j] > rating[k]共有minToMax[j]种
                    result += minToMax[j];
                }
                if (rating[i] < rating[j]) {
                    ++maxToMin[i];
                    result += maxToMin[j];
                }
            }
        }
        return result;
    }
}