leetcode士兵 365DaysLeetCode 每天至少在LeetCode上做1道题的个人挑战

利特码我的个人目标是每天至少完成一次LeetCode编程挑战，持续一年！注意*这个项目现在不会在这里更新。可以在以下位置找到新链接计算团队数量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