|
| 1 | +#!/usr/bin/env python3 |
| 2 | +""" |
| 3 | +CREATED AT: 2022εΉ΄11ζ20ζ₯ |
| 4 | + |
| 5 | +URL: https://leetcode.com/problems/number-of-unequal-triplets-in-array/ |
| 6 | + |
| 7 | +GITHUB: https://github.com/Jiezhi/myleetcode |
| 8 | + |
| 9 | +FileName: 2475-NumberOfUnequalTripletsInArray |
| 10 | + |
| 11 | +Difficulty: Easy |
| 12 | + |
| 13 | +Desc: |
| 14 | + |
| 15 | +Tag: |
| 16 | + |
| 17 | +See: |
| 18 | + |
| 19 | +""" |
| 20 | +from tool import * |
| 21 | + |
| 22 | + |
| 23 | +class Solution: |
| 24 | + def unequalTriplets(self, nums: List[int]) -> int: |
| 25 | + """ |
| 26 | + 3 <= nums.length <= 100 |
| 27 | + 1 <= nums[i] <= 1000 |
| 28 | + """ |
| 29 | + n = len(nums) |
| 30 | + ret = 0 |
| 31 | + for i in range(n - 2): |
| 32 | + for j in range(i + 1, n - 1): |
| 33 | + for k in range(j + 1, n): |
| 34 | + if nums[i] != nums[j] and nums[i] != nums[k] and nums[j] != nums[k]: |
| 35 | + ret += 1 |
| 36 | + return ret |
| 37 | + |
| 38 | + |
| 39 | +def test(): |
| 40 | + assert Solution().unequalTriplets(nums=[4, 4, 2, 4, 3]) == 3 |
| 41 | + assert Solution().unequalTriplets(nums=[1, 1, 1, 1, 1]) == 0 |
| 42 | + |
| 43 | + |
| 44 | +if __name__ == '__main__': |
| 45 | + test() |
0 commit comments