class Solution {
public:
int numTeams(vector<int>& rating) {
int sum=0;
for(int i=0;i<rating.size();i++)
{
for(int j=i+1;j<rating.size();j++)
{
for(int k=j+1;k<rating.size();k++)
{
if((rating[i]>rating[j]&&rating[j]>rating[k])||(rating[i]<rating[j]&&rating[j]<rating[k]))
sum++;
}
}
}
return sum;
}
};
LeetCode:1395. 统计作战单位数
最新推荐文章于 2022-07-02 14:57:36 发布