[Leet Code] Count Number of Teams

  • 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).
Input: rating = [2,5,3,4,1]
Output: 3
Explanation: We can form three teams given the conditions. (2,3,4), (5,4,1), (5,3,1).
Input: rating = [2,1,3]
Output: 0
Explanation: We can't form any team given the conditions.
Input: rating = [1,2,3,4]
Output: 4
  • n == rating.length
  • 1 <= n <= 200
  • 1 <= rating[i] <= 10^5
class Solution(object):
def numTeams(self, rating):
"""
:type rating: List[int]
:rtype: int
"""
counter = 0
for i in range(len(rating)):
for j in range(len(rating)):
for k in range(len(rating)):
if i < j < k and ((rating[i] < rating[j] < rating[k]) or (rating[i] > rating[j] > rating[k])):
counter += 1

return counter

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Matthew Boyd

Matthew Boyd

Learning, and posting my findings!