-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmaximum-product-of-word-lengths.py
66 lines (44 loc) · 1.7 KB
/
maximum-product-of-word-lengths.py
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
# LEetcode # 318
# https://leetcode.com/problems/maximum-product-of-word-lengths/submissions/
# Brute force attempt
class Solution:
def maxProduct(self, words: List[str]) -> int:
maxLen = 0
for i in range(len(words)):
for j in range(len(words)):
word1 = words[i]
word2 = words[j]
if self.checkChars(word1,word2):
lenght = len(word1)*len(word2)
if lenght>maxLen:
maxLen = lenght
return maxLen
def checkChars(self,word1,word2):
L1 = list(word1)
L2 = list(word2)
for i in range(len(L1)):
for j in range(len(L2)):
if L1[i] == L2[j]:
return False
return True
# Checks if lenght is greater before checking for repeated char
class Solution:
def maxProduct(self, words: List[str]) -> int:
maxLen = 0
for i in range(len(words)):
for j in range(len(words)):
word1 = words[i]
word2 = words[j]
lenght = len(word1)*len(word2)
if lenght>maxLen:
if self.checkChars(word1,word2):
maxLen = lenght
return maxLen
def checkChars(self,word1,word2):
L1 = list(word1)
L2 = list(word2)
for i in range(len(L1)):
for j in range(len(L2)):
if L1[i] == L2[j]:
return False
return True