leetcode-solution/Python/2094-finding-3-digit-even-numbers.py at main · hogan-tech/leetcode-solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
# time complexity: O(n^3)
# space complexity: O(n)
from typing import List


class Solution:
    def findEvenNumbers(self, digits: List[int]) -> List[int]:
        result = []
        numsSet = set()
        for i in range(len(digits)):
            for j in range(len(digits)):
                for k in range(len(digits)):
                    if i == j or j == k or k == i:
                        continue
                    if digits[i] == 0:
                        continue
                    if digits[k] % 2:
                        continue
                    validNum = digits[i] * 100 + digits[j] * 10 + digits[k]
                    if validNum not in numsSet:
                        numsSet.add(validNum)
                        result.append(validNum)
        result.sort()
        return result


digits = [2, 1, 3, 0]
print(Solution().findEvenNumbers(digits))
digits = [2, 2, 8, 8, 2]
print(Solution().findEvenNumbers(digits))
digits = [3, 7, 5]
print(Solution().findEvenNumbers(digits))